About the Execution of ITS-Tools for CANInsertWithFailure-PT-005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 582.483 | 42558.00 | 58002.00 | 795.50 | 1 1 1 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.r034-tall-177946842100701.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 CANInsertWithFailure-PT-005, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100701
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 6 10:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 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 202K 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 CANInsertWithFailure-PT-005-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-005-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779662725104
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 22:45:26] [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-24 22:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:45:26] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2026-05-24 22:45:26] [INFO ] Transformed 114 places.
[2026-05-24 22:45:26] [INFO ] Transformed 180 transitions.
[2026-05-24 22:45:26] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 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, 1, 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-13545832728276463541.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3196143276218501632.kers'
[2026-05-24 22:45:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13545832728276463541.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3196143276218501632.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:45:26] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3196143276218501632.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 5, 5, 1, 5, 1, 1, 1, 5, 1, 5, 5, 5, 1, 1, 1]
FORMULA CANInsertWithFailure-PT-005-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (107 resets) in 44 ms. (222 steps per ms)
FORMULA CANInsertWithFailure-PT-005-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (170 resets) in 71 ms. (972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5, 5]
[2026-05-24 22:45:26] [INFO ] Invariant cache hit.
[2026-05-24 22:45:26] [INFO ] [Real]Absence check using 6 positive place invariants in 10 ms returned sat
[2026-05-24 22:45:26] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-24 22:45:26] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2026-05-24 22:45:26] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:45:26] [INFO ] [Real]Added 45 Read/Feed constraints in 12 ms returned sat
[2026-05-24 22:45:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Nat]Added 45 Read/Feed constraints in 15 ms returned sat
[2026-05-24 22:45:27] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 17 ms.
[2026-05-24 22:45:27] [INFO ] Added : 38 causal constraints over 8 iterations in 165 ms. Result :sat
Minimization took 103 ms.
[2026-05-24 22:45:27] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Real]Added 45 Read/Feed constraints in 17 ms returned sat
[2026-05-24 22:45:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Nat]Added 45 Read/Feed constraints in 11 ms returned sat
[2026-05-24 22:45:27] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 15 ms.
[2026-05-24 22:45:27] [INFO ] Added : 38 causal constraints over 8 iterations in 143 ms. Result :sat
Minimization took 57 ms.
[2026-05-24 22:45:27] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-24 22:45:27] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Added 45 Read/Feed constraints in 9 ms returned sat
[2026-05-24 22:45:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Added 45 Read/Feed constraints in 19 ms returned sat
[2026-05-24 22:45:28] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 17 ms.
[2026-05-24 22:45:28] [INFO ] Added : 49 causal constraints over 10 iterations in 170 ms. Result :sat
Minimization took 72 ms.
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Added 45 Read/Feed constraints in 4 ms returned sat
[2026-05-24 22:45:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Added 45 Read/Feed constraints in 12 ms returned sat
[2026-05-24 22:45:28] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 10 ms.
[2026-05-24 22:45:28] [INFO ] Added : 38 causal constraints over 8 iterations in 117 ms. Result :sat
Minimization took 93 ms.
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned unsat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Real]Added 45 Read/Feed constraints in 5 ms returned sat
[2026-05-24 22:45:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2026-05-24 22:45:28] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Nat]Added 45 Read/Feed constraints in 21 ms returned sat
[2026-05-24 22:45:29] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 9 ms.
[2026-05-24 22:45:29] [INFO ] Added : 49 causal constraints over 10 iterations in 138 ms. Result :sat
Minimization took 70 ms.
[2026-05-24 22:45:29] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Real]Added 45 Read/Feed constraints in 4 ms returned sat
[2026-05-24 22:45:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2026-05-24 22:45:29] [INFO ] [Nat]Added 45 Read/Feed constraints in 13 ms returned sat
[2026-05-24 22:45:29] [INFO ] Computed and/alt/rep : 165/270/165 causal constraints (skipped 10 transitions) in 9 ms.
[2026-05-24 22:45:29] [INFO ] Added : 40 causal constraints over 8 iterations in 113 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 1, 5, 5]
FORMULA CANInsertWithFailure-PT-005-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5]
Support contains 6 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 79 transition count 146
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 69 place count 79 transition count 145
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 71 place count 78 transition count 145
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 101 place count 63 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 110 place count 63 transition count 121
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 63 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 62 transition count 120
Partial Free-agglomeration rule applied 36 times.
Drop transitions (Partial Free agglomeration) removed 36 transitions
Iterating global reduction 3 with 36 rules applied. Total rules applied 148 place count 62 transition count 120
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 157 place count 62 transition count 120
Applied a total of 157 rules in 56 ms. Remains 62 /114 variables (removed 52) and now considering 120/180 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 62/114 places, 120/180 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7204215970164793883.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15291970508335748742.kers'
[2026-05-24 22:45:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7204215970164793883.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15291970508335748742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 120 rows 62 cols 283 entries
Finished phase 1 with 50 SingleSign rule and 5 generalized
[2026-05-24 22:45:29] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15291970508335748742.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5]
RANDOM walk for 1000000 steps (31307 resets) in 1205 ms. (829 steps per ms)
BEST_FIRST walk for 6000004 steps (31180 resets) in 2326 ms. (2578 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5]
[2026-05-24 22:45:33] [INFO ] Invariant cache hit.
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-24 22:45:33] [INFO ] State equation strengthened by 97 read => feed constraints.
[2026-05-24 22:45:33] [INFO ] [Real]Added 97 Read/Feed constraints in 10 ms returned sat
[2026-05-24 22:45:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Added 97 Read/Feed constraints in 8 ms returned sat
[2026-05-24 22:45:33] [INFO ] Computed and/alt/rep : 96/309/96 causal constraints (skipped 19 transitions) in 7 ms.
[2026-05-24 22:45:33] [INFO ] Added : 8 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 51 ms.
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Added 97 Read/Feed constraints in 15 ms returned sat
[2026-05-24 22:45:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 11 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Added 97 Read/Feed constraints in 13 ms returned sat
[2026-05-24 22:45:33] [INFO ] Computed and/alt/rep : 96/309/96 causal constraints (skipped 19 transitions) in 9 ms.
[2026-05-24 22:45:33] [INFO ] Added : 27 causal constraints over 6 iterations in 87 ms. Result :sat
Minimization took 48 ms.
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Real]Added 97 Read/Feed constraints in 9 ms returned sat
[2026-05-24 22:45:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-24 22:45:33] [INFO ] [Nat]Added 97 Read/Feed constraints in 10 ms returned sat
[2026-05-24 22:45:34] [INFO ] Computed and/alt/rep : 96/309/96 causal constraints (skipped 19 transitions) in 7 ms.
[2026-05-24 22:45:34] [INFO ] Added : 11 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 44 ms.
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Added 97 Read/Feed constraints in 9 ms returned sat
[2026-05-24 22:45:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Added 97 Read/Feed constraints in 30 ms returned sat
[2026-05-24 22:45:34] [INFO ] Computed and/alt/rep : 96/309/96 causal constraints (skipped 19 transitions) in 7 ms.
[2026-05-24 22:45:34] [INFO ] Added : 10 causal constraints over 2 iterations in 31 ms. Result :sat
Minimization took 41 ms.
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Added 97 Read/Feed constraints in 9 ms returned sat
[2026-05-24 22:45:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Added 97 Read/Feed constraints in 9 ms returned sat
[2026-05-24 22:45:34] [INFO ] Computed and/alt/rep : 96/309/96 causal constraints (skipped 19 transitions) in 9 ms.
[2026-05-24 22:45:34] [INFO ] Added : 10 causal constraints over 2 iterations in 38 ms. Result :sat
Minimization took 44 ms.
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Real]Added 97 Read/Feed constraints in 9 ms returned sat
[2026-05-24 22:45:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-24 22:45:34] [INFO ] [Nat]Added 97 Read/Feed constraints in 11 ms returned sat
[2026-05-24 22:45:34] [INFO ] Computed and/alt/rep : 96/309/96 causal constraints (skipped 19 transitions) in 9 ms.
[2026-05-24 22:45:34] [INFO ] Added : 26 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1] Max Struct:[5, 5, 5, 5, 5, 5]
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/62 places, 120/120 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2026-05-24 22:45:34] [INFO ] Invariant cache hit.
[2026-05-24 22:45:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-24 22:45:34] [INFO ] Invariant cache hit.
[2026-05-24 22:45:34] [INFO ] State equation strengthened by 97 read => feed constraints.
[2026-05-24 22:45:35] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2026-05-24 22:45:35] [INFO ] Redundant transitions in 4 ms returned []
Running 115 sub problems to find dead transitions.
[2026-05-24 22:45:35] [INFO ] Invariant cache hit.
[2026-05-24 22:45:35] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (OVERLAPS) 120/181 variables, 61/87 constraints. Problems are: Problem set: 0 solved, 115 unsolved
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD116 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 97/184 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/184 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/185 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/185 constraints. Problems are: Problem set: 9 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 185 constraints, problems are : Problem set: 9 solved, 106 unsolved in 8146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 2/7 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 19/26 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/26 constraints. Problems are: Problem set: 9 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 120/181 variables, 61/87 constraints. Problems are: Problem set: 9 solved, 106 unsolved
Problem TDEAD55 is UNSAT
Problem TDEAD105 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 97/184 constraints. Problems are: Problem set: 11 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 104/288 constraints. Problems are: Problem set: 11 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/288 constraints. Problems are: Problem set: 11 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/289 constraints. Problems are: Problem set: 11 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/289 constraints. Problems are: Problem set: 11 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/289 constraints. Problems are: Problem set: 11 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 289 constraints, problems are : Problem set: 11 solved, 104 unsolved in 9120 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 104/115 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17320ms problems are : Problem set: 11 solved, 104 unsolved
Search for dead transitions found 11 dead transitions in 17330ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/62 places, 109/120 transitions.
Graph (complete) has 209 edges and 62 vertex of which 60 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 54 transition count 97
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 54 transition count 97
Applied a total of 13 rules in 16 ms. Remains 54 /62 variables (removed 8) and now considering 97/109 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2703760706486501525.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5009945862416278773.kers'
[2026-05-24 22:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2703760706486501525.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5009945862416278773.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 97 rows 54 cols 221 entries
Finished phase 1 with 44 SingleSign rule and 2 generalized
[2026-05-24 22:45:52] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5009945862416278773.kers
Total runtime 0 ms.
[2026-05-24 22:45:52] [INFO ] Implicit Places using invariants in 48 ms returned [13, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 52/62 places, 97/120 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 51 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 51 transition count 96
Applied a total of 5 rules in 10 ms. Remains 51 /52 variables (removed 1) and now considering 96/97 (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-7153222348469909016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12721254361309876527.kers'
[2026-05-24 22:45:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7153222348469909016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12721254361309876527.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 96 rows 51 cols 218 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 22:45:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12721254361309876527.kers
Total runtime 0 ms.
[2026-05-24 22:45:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-24 22:45:52] [INFO ] Invariant cache hit.
[2026-05-24 22:45:52] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 22:45:52] [INFO ] Implicit Places using invariants and state equation in 83 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 3 : 51/62 places, 96/120 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 17793 ms. Remains : 51/62 places, 96/120 transitions.
[2026-05-24 22:45:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1] Max Struct:[1, 5, 5, 1, 5, 5]
FORMULA CANInsertWithFailure-PT-005-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (35795 resets) in 1008 ms. (991 steps per ms)
BEST_FIRST walk for 4000004 steps (27438 resets) in 1381 ms. (2894 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1] Max Struct:[5, 5, 5, 5]
[2026-05-24 22:45:55] [INFO ] Invariant cache hit.
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-24 22:45:55] [INFO ] State equation strengthened by 71 read => feed constraints.
[2026-05-24 22:45:55] [INFO ] [Real]Added 71 Read/Feed constraints in 8 ms returned sat
[2026-05-24 22:45:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Added 71 Read/Feed constraints in 13 ms returned unsat
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Added 71 Read/Feed constraints in 6 ms returned sat
[2026-05-24 22:45:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Added 71 Read/Feed constraints in 8 ms returned sat
[2026-05-24 22:45:55] [INFO ] Computed and/alt/rep : 83/336/83 causal constraints (skipped 8 transitions) in 7 ms.
[2026-05-24 22:45:55] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 24 ms.
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Added 71 Read/Feed constraints in 6 ms returned sat
[2026-05-24 22:45:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Added 71 Read/Feed constraints in 7 ms returned sat
[2026-05-24 22:45:55] [INFO ] Computed and/alt/rep : 83/336/83 causal constraints (skipped 8 transitions) in 9 ms.
[2026-05-24 22:45:55] [INFO ] Added : 20 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 22 ms.
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Real]Added 71 Read/Feed constraints in 5 ms returned sat
[2026-05-24 22:45:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2026-05-24 22:45:55] [INFO ] [Nat]Added 71 Read/Feed constraints in 9 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1] Max Struct:[1, 5, 5, 1]
FORMULA CANInsertWithFailure-PT-005-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-005-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[5, 5]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 96/96 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 1 rules applied. Total rules applied 1 place count 51 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 50 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 4 place count 49 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 6 place count 48 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 48 transition count 93
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 48 transition count 93
Applied a total of 11 rules in 15 ms. Remains 48 /51 variables (removed 3) and now considering 93/96 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 48/51 places, 93/96 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12342009278439845616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16686721922423286776.kers'
[2026-05-24 22:45:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12342009278439845616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16686721922423286776.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 93 rows 48 cols 215 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-24 22:45:55] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16686721922423286776.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1] Max Struct:[5, 5]
RANDOM walk for 1000000 steps (44713 resets) in 1065 ms. (938 steps per ms)
BEST_FIRST walk for 2000002 steps (16459 resets) in 682 ms. (2928 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1] Max Struct:[5, 5]
[2026-05-24 22:45:57] [INFO ] Invariant cache hit.
[2026-05-24 22:45:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2026-05-24 22:45:57] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-24 22:45:57] [INFO ] [Real]Added 74 Read/Feed constraints in 7 ms returned sat
[2026-05-24 22:45:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 13 ms returned sat
[2026-05-24 22:45:57] [INFO ] Computed and/alt/rep : 75/319/75 causal constraints (skipped 13 transitions) in 6 ms.
[2026-05-24 22:45:57] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 20 ms.
[2026-05-24 22:45:57] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Real]Added 74 Read/Feed constraints in 7 ms returned sat
[2026-05-24 22:45:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 22:45:57] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2026-05-24 22:45:57] [INFO ] [Nat]Added 74 Read/Feed constraints in 6 ms returned sat
[2026-05-24 22:45:57] [INFO ] Computed and/alt/rep : 75/319/75 causal constraints (skipped 13 transitions) in 4 ms.
[2026-05-24 22:45:57] [INFO ] Added : 16 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1] Max Struct:[5, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1] Max Struct:[5, 5]
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 93/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 48 /48 variables (removed 0) and now considering 93/93 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 48/48 places, 93/93 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 93/93 transitions.
Applied a total of 0 rules in 7 ms. Remains 48 /48 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2026-05-24 22:45:57] [INFO ] Invariant cache hit.
[2026-05-24 22:45:57] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 22:45:57] [INFO ] Invariant cache hit.
[2026-05-24 22:45:57] [INFO ] State equation strengthened by 74 read => feed constraints.
[2026-05-24 22:45:57] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-24 22:45:57] [INFO ] Redundant transitions in 1 ms returned []
Running 88 sub problems to find dead transitions.
[2026-05-24 22:45:57] [INFO ] Invariant cache hit.
[2026-05-24 22:45:57] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 93/140 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 74/131 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 133 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4252 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 93/140 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 74/132 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 88/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/141 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 221 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3734 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 48/48 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7999ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 7999ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8166 ms. Remains : 48/48 places, 93/93 transitions.
RANDOM walk for 40000 steps (1792 resets) in 470 ms. (84 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (313 resets) in 100 ms. (396 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (311 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (335 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (342 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
[2026-05-24 22:46:06] [INFO ] Flatten gal took : 34 ms
Probably explored full state space saw : 6732 states, properties seen :0
Probabilistic random walk after 38412 steps, saw 6732 distinct states, run finished after 194 ms. (steps per millisecond=198 ) properties seen :0
[2026-05-24 22:46:06] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:46:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12805239002665502607.gal : 7 ms
[2026-05-24 22:46:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9332260064446381347.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12805239002665502607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9332260064446381347.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 ...329
Loading property file /tmp/ReachabilityCardinality9332260064446381347.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :12 after 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 47
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :47 after 157
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :157 after 422
Explored full state space saw : 6732 states, properties seen :0
Exhaustive walk after 38412 steps, saw 6732 distinct states, run finished after 148 ms. (steps per millisecond=259 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA CANInsertWithFailure-PT-005-UpperBounds-04 1 TECHNIQUES REACHABILITY_MIN
FORMULA CANInsertWithFailure-PT-005-UpperBounds-11 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-24 22:46:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (44666 resets) in 1019 ms. (980 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 41336 ms.
BK_STOP 1779662767662
--------------------
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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r034-tall-177946842100701"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-005.tgz
mv CANInsertWithFailure-PT-005 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 ;