About the Execution of ITS-Tools for DoubleLock-PT-p2s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10779.432 | 3600000.00 | 3803397.00 | 11049.10 | 1 1 1 1 1 1 1 inf ? 1 1 1 1 0 0 0 | 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.r114-smll-177955740400037.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 DoubleLock-PT-p2s2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-177955740400037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.4K Mar 6 18:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 6 18:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 18:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 09:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 09:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 09:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 6 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Mar 6 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 09:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 09:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 813K 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 DoubleLock-PT-p2s2-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p2s2-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779605012171
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p2s2
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 06:43:34] [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 06:43:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 06:43:35] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2026-05-24 06:43:35] [INFO ] Transformed 184 places.
[2026-05-24 06:43:35] [INFO ] Transformed 1832 transitions.
[2026-05-24 06:43:35] [INFO ] Parsed PT model containing 184 places and 1832 transitions and 7424 arcs in 531 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 36 places in 11 ms
Reduce places removed 36 places and 64 transitions.
FORMULA DoubleLock-PT-p2s2-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p2s2-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[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]
Current structural bounds on expressions (Before main loop) : Max Seen:[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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4981851069290002972.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4507887691336786970.kers'
[2026-05-24 06:43:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4981851069290002972.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4507887691336786970.kers]
Normalized transition count is 1225 out of 1768 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1225 rows 147 cols 4714 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 06:43:35] [INFO ] Computed 4 invariants in 12 ms
Computed 4 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4507887691336786970.kers
Total runtime 17 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, +inf, +inf, 1, 1, 1, 1]
RANDOM walk for 10003 steps (100 resets) in 76 ms. (129 steps per ms)
FORMULA DoubleLock-PT-p2s2-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p2s2-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (82 resets) in 85 ms. (465 steps per ms)
FORMULA DoubleLock-PT-p2s2-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[7, 2] Max Struct:[+inf, +inf]
[2026-05-24 06:43:35] [INFO ] Flow matrix only has 1225 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7631413102746692779.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11730087752868166646.kers'
[2026-05-24 06:43:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7631413102746692779.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11730087752868166646.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1225 rows 147 cols 4714 entries
Finished phase 1 with 144 SingleSign rule and 0 generalized
[2026-05-24 06:43:35] [INFO ] Computed 4 invariants in 6 ms
Computed 4 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11730087752868166646.kers
Total runtime 9 ms.
[2026-05-24 06:43:36] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2026-05-24 06:43:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2026-05-24 06:43:36] [INFO ] [Real]Absence check using state equation in 576 ms returned sat
[2026-05-24 06:43:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:43:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2026-05-24 06:43:36] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-24 06:43:37] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2026-05-24 06:43:37] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:43:38] [INFO ] [Nat]Added 116 Read/Feed constraints in 501 ms returned sat
[2026-05-24 06:43:38] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 463 ms.
[2026-05-24 06:43:38] [INFO ] Added : 0 causal constraints over 0 iterations in 667 ms. Result :sat
Minimization took 600 ms.
[2026-05-24 06:43:39] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-24 06:43:39] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2026-05-24 06:43:40] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2026-05-24 06:43:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:43:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:43:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-24 06:43:40] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2026-05-24 06:43:40] [INFO ] [Nat]Added 116 Read/Feed constraints in 465 ms returned sat
[2026-05-24 06:43:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1429 ms
[2026-05-24 06:43:42] [INFO ] Computed and/alt/rep : 164/1284/164 causal constraints (skipped 1059 transitions) in 199 ms.
[2026-05-24 06:43:42] [INFO ] Added : 0 causal constraints over 0 iterations in 340 ms. Result :sat
Minimization took 637 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[7, 2] Max Struct:[+inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[7, 2] Max Struct:[+inf, +inf]
Support contains 2 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 1768/1768 transitions.
Graph (complete) has 2955 edges and 148 vertex of which 144 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.9 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 144 transition count 1736
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 143 transition count 1704
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 143 transition count 1704
Applied a total of 35 rules in 171 ms. Remains 143 /148 variables (removed 5) and now considering 1704/1768 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 143/148 places, 1704/1768 transitions.
[2026-05-24 06:43:43] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
findPositiveTsemiflow completed in 646 ms - Found solution {12=2, 18=1, 29=1, 710=1, 711=1, 1137=2} and attempted to minimize in 1 ms success -> {18=1, 29=1, 680=1, 681=1, 1108=2}
FORMULA DoubleLock-PT-p2s2-UpperBounds-07 +inf TECHNIQUES TOPOLOGICAL COVER_WALK
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-6728300113825929137.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17629586616776299645.kers'
[2026-05-24 06:43:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6728300113825929137.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17629586616776299645.kers]
Normalized transition count is 1161 out of 1704 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1161 rows 143 cols 4458 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:43:54] [INFO ] Computed 3 invariants in 6 ms
Computed 3 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17629586616776299645.kers
Total runtime 9 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000006 steps (10138 resets) in 2078 ms. (481 steps per ms)
BEST_FIRST walk for 1000001 steps (1940 resets) in 697 ms. (1432 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2026-05-24 06:43:57] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4347431023702927680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16174897503692812917.kers'
[2026-05-24 06:43:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4347431023702927680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16174897503692812917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1161 rows 143 cols 4458 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:43:57] [INFO ] Computed 3 invariants in 5 ms
Computed 3 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16174897503692812917.kers
Total runtime 7 ms.
[2026-05-24 06:43:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:43:57] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2026-05-24 06:43:57] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:43:57] [INFO ] [Real]Added 116 Read/Feed constraints in 171 ms returned sat
[2026-05-24 06:43:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:43:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2026-05-24 06:43:58] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2026-05-24 06:43:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 329 ms returned sat
[2026-05-24 06:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 937 ms
[2026-05-24 06:43:59] [INFO ] Computed and/alt/rep : 148/1140/148 causal constraints (skipped 1011 transitions) in 114 ms.
[2026-05-24 06:43:59] [INFO ] Added : 0 causal constraints over 0 iterations in 206 ms. Result :sat
Minimization took 1488 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 47 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 143/143 places, 1704/1704 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1704/1704 transitions.
Applied a total of 0 rules in 40 ms. Remains 143 /143 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2026-05-24 06:44:01] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2026-05-24 06:44:01] [INFO ] Invariant cache hit.
[2026-05-24 06:44:02] [INFO ] Implicit Places using invariants in 525 ms returned []
[2026-05-24 06:44:02] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2026-05-24 06:44:02] [INFO ] Invariant cache hit.
[2026-05-24 06:44:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2026-05-24 06:44:04] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2203 ms to find 0 implicit places.
[2026-05-24 06:44:04] [INFO ] Redundant transitions in 181 ms returned []
Running 1702 sub problems to find dead transitions.
[2026-05-24 06:44:04] [INFO ] Flow matrix only has 1161 transitions (discarded 543 similar events)
[2026-05-24 06:44:04] [INFO ] Invariant cache hit.
[2026-05-24 06:44:04] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1702 unsolved
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1128 is UNSAT
Problem TDEAD1129 is UNSAT
Problem TDEAD1130 is UNSAT
Problem TDEAD1131 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1147 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1346 is UNSAT
Problem TDEAD1347 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1354 is UNSAT
Problem TDEAD1355 is UNSAT
Problem TDEAD1360 is UNSAT
Problem TDEAD1361 is UNSAT
Problem TDEAD1362 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1371 is UNSAT
Problem TDEAD1376 is UNSAT
Problem TDEAD1384 is UNSAT
Problem TDEAD1385 is UNSAT
Problem TDEAD1386 is UNSAT
Problem TDEAD1387 is UNSAT
Problem TDEAD1392 is UNSAT
Problem TDEAD1393 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1399 is UNSAT
Problem TDEAD1403 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1435 is UNSAT
Problem TDEAD1436 is UNSAT
Problem TDEAD1441 is UNSAT
Problem TDEAD1442 is UNSAT
Problem TDEAD1443 is UNSAT
Problem TDEAD1450 is UNSAT
Problem TDEAD1451 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1460 is UNSAT
Problem TDEAD1465 is UNSAT
Problem TDEAD1466 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1468 is UNSAT
Problem TDEAD1473 is UNSAT
Problem TDEAD1474 is UNSAT
Problem TDEAD1475 is UNSAT
Problem TDEAD1480 is UNSAT
Problem TDEAD1481 is UNSAT
Problem TDEAD1482 is UNSAT
Problem TDEAD1483 is UNSAT
Problem TDEAD1488 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1490 is UNSAT
Problem TDEAD1495 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1504 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1513 is UNSAT
Problem TDEAD1514 is UNSAT
Problem TDEAD1515 is UNSAT
Problem TDEAD1520 is UNSAT
Problem TDEAD1521 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1527 is UNSAT
Problem TDEAD1531 is UNSAT
Problem TDEAD1536 is UNSAT
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1563 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1595 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 143/1304 variables, and 5 constraints, problems are : Problem set: 168 solved, 1534 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/143 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 1702/1702 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 168 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 2/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/5 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 3 (OVERLAPS) 1161/1304 variables, 143/148 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1304 variables, 116/264 constraints. Problems are: Problem set: 168 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1304/1304 variables, and 1798 constraints, problems are : Problem set: 168 solved, 1534 unsolved in 30579 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1534/1702 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62363ms problems are : Problem set: 168 solved, 1534 unsolved
Search for dead transitions found 168 dead transitions in 62415ms
Found 168 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 168 transitions
Dead transitions reduction (with SMT) removed 168 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 143/143 places, 1536/1704 transitions.
Applied a total of 0 rules in 32 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2026-05-24 06:45:06] [INFO ] Redundant transitions in 103 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 65071 ms. Remains : 143/143 places, 1536/1704 transitions.
[2026-05-24 06:45:06] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
findPositiveTsemiflow completed in 641 ms - Found solution {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1} and attempted to minimize in 0 ms success -> {18=1, 29=1, 722=1, 723=1, 1011=2}
Current structural bounds on expressions (after cover walk) : Max Seen:[4] 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-10741893119714849806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11725346685437689592.kers'
[2026-05-24 06:45:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10741893119714849806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11725346685437689592.kers]
Normalized transition count is 1021 out of 1536 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1021 rows 143 cols 3906 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:45:17] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-11725346685437689592.kers
Total runtime 10 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 1000000 steps (10175 resets) in 1840 ms. (543 steps per ms)
BEST_FIRST walk for 1000000 steps (1944 resets) in 652 ms. (1531 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2026-05-24 06:45:20] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-977585234456207562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2270828125512488253.kers'
[2026-05-24 06:45:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-977585234456207562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2270828125512488253.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 143 cols 3906 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:45:20] [INFO ] Computed 3 invariants in 4 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2270828125512488253.kers
Total runtime 7 ms.
[2026-05-24 06:45:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:45:20] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2026-05-24 06:45:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:45:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:45:21] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2026-05-24 06:45:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:45:21] [INFO ] [Nat]Added 112 Read/Feed constraints in 264 ms returned sat
[2026-05-24 06:45:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1174 ms
[2026-05-24 06:45:22] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 169 ms.
[2026-05-24 06:45:22] [INFO ] Added : 0 causal constraints over 0 iterations in 307 ms. Result :sat
Minimization took 1079 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 42 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 34 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2026-05-24 06:45:24] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:45:24] [INFO ] Invariant cache hit.
[2026-05-24 06:45:24] [INFO ] Implicit Places using invariants in 471 ms returned []
[2026-05-24 06:45:24] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:45:24] [INFO ] Invariant cache hit.
[2026-05-24 06:45:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:45:26] [INFO ] Implicit Places using invariants and state equation in 2380 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
[2026-05-24 06:45:27] [INFO ] Redundant transitions in 57 ms returned []
Running 1534 sub problems to find dead transitions.
[2026-05-24 06:45:27] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:45:27] [INFO ] Invariant cache hit.
[2026-05-24 06:45:27] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 143/1164 variables, and 3 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/143 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1534 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 2 (OVERLAPS) 1021/1164 variables, 143/146 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1164 variables, 112/258 constraints. Problems are: Problem set: 0 solved, 1534 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 1792 constraints, problems are : Problem set: 0 solved, 1534 unsolved in 30555 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1534/1534 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61941ms problems are : Problem set: 0 solved, 1534 unsolved
Search for dead transitions found 0 dead transitions in 61948ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64940 ms. Remains : 143/143 places, 1536/1536 transitions.
[2026-05-24 06:46:29] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
findPositiveTsemiflow completed in 680 ms - Found solution {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1} and attempted to minimize in 0 ms success -> {18=1, 29=1, 722=1, 723=1, 1011=2}
Current structural bounds on expressions (after cover walk) : Max Seen:[4] Max Struct:[+inf]
RANDOM walk for 40006 steps (412 resets) in 569 ms. (70 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (74 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
[2026-05-24 06:46:40] [INFO ] Flatten gal took : 370 ms
[2026-05-24 06:46:41] [INFO ] Flatten gal took : 170 ms
[2026-05-24 06:46:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1072115601376279678.gal : 87 ms
[2026-05-24 06:46:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12573564111711457735.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/ReachabilityCardinality1072115601376279678.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12573564111711457735.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/ReachabilityCardinality12573564111711457735.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
Interrupted probabilistic random walk after 371941 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 371941 steps, saw 253712 distinct states, run finished after 3012 ms. (steps per millisecond=123 ) properties seen :0
[2026-05-24 06:46:43] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:46:43] [INFO ] Invariant cache hit.
[2026-05-24 06:46:43] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1115 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1115 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 78/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1115 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 78/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1325ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 31 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40004 steps (413 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 373636 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 1
Probabilistic random walk after 373636 steps, saw 254849 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2026-05-24 06:46:47] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:46:47] [INFO ] Invariant cache hit.
[2026-05-24 06:46:47] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1115 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1115 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 78/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 659 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1115 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 78/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1601ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 32 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 34 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2026-05-24 06:46:49] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:46:49] [INFO ] Invariant cache hit.
[2026-05-24 06:46:50] [INFO ] Implicit Places using invariants in 381 ms returned []
[2026-05-24 06:46:50] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:46:50] [INFO ] Invariant cache hit.
[2026-05-24 06:46:50] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:46:51] [INFO ] Implicit Places using invariants and state equation in 1765 ms returned []
Implicit Place search using SMT with State Equation took 2152 ms to find 0 implicit places.
[2026-05-24 06:46:51] [INFO ] Redundant transitions in 68 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2263 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 515 place count 143 transition count 1011
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 535 place count 133 transition count 1011
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 541 place count 130 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 542 place count 129 transition count 976
Iterating global reduction 1 with 1 rules applied. Total rules applied 543 place count 129 transition count 976
Applied a total of 543 rules in 63 ms. Remains 129 /143 variables (removed 14) and now considering 976/1536 (removed 560) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11925424033023019624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12025351785744494337.kers'
[2026-05-24 06:46:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11925424033023019624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12025351785744494337.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 976 rows 129 cols 3752 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-24 06:46:51] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-12025351785744494337.kers
Total runtime 9 ms.
[2026-05-24 06:46:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-24 06:46:52] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 06:46:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:46:52] [INFO ] After 293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 06:46:52] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 06:46:52] [INFO ] After 433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 06:46:52] [INFO ] Flatten gal took : 67 ms
[2026-05-24 06:46:52] [INFO ] Flatten gal took : 58 ms
[2026-05-24 06:46:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15013572144891512497.gal : 30 ms
[2026-05-24 06:46:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8778196357163423145.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/ReachabilityCardinality15013572144891512497.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8778196357163423145.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/ReachabilityCardinality8778196357163423145.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 86745
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86745 after 172257
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :172257 after 322656
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
Detected timeout of ITS tools.
[2026-05-24 06:47:08] [INFO ] Flatten gal took : 69 ms
[2026-05-24 06:47:08] [INFO ] Applying decomposition
[2026-05-24 06:47:08] [INFO ] Flatten gal took : 72 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7694743353434570700.txt' '-o' '/tmp/graph7694743353434570700.bin' '-w' '/tmp/graph7694743353434570700.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7694743353434570700.bin' '-l' '-1' '-v' '-w' '/tmp/graph7694743353434570700.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:47:08] [INFO ] Decomposing Gal with order
[2026-05-24 06:47:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:47:09] [INFO ] Removed a total of 2247 redundant transitions.
[2026-05-24 06:47:09] [INFO ] Flatten gal took : 368 ms
[2026-05-24 06:47:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 59 ms.
[2026-05-24 06:47:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10264518915665982794.gal : 19 ms
[2026-05-24 06:47:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14566410773844219434.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/ReachabilityCardinality10264518915665982794.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14566410773844219434.prop' '--nowitness'
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 ...309
Loading property file /tmp/ReachabilityCardinality14566410773844219434.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 765
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :765 after 190627
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32753 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 06:47:24] [INFO ] Flatten gal took : 52 ms
[2026-05-24 06:47:24] [INFO ] Applying decomposition
[2026-05-24 06:47:24] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15781993610338472851.txt' '-o' '/tmp/graph15781993610338472851.bin' '-w' '/tmp/graph15781993610338472851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15781993610338472851.bin' '-l' '-1' '-v' '-w' '/tmp/graph15781993610338472851.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:47:24] [INFO ] Decomposing Gal with order
[2026-05-24 06:47:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:47:25] [INFO ] Removed a total of 3531 redundant transitions.
[2026-05-24 06:47:25] [INFO ] Flatten gal took : 143 ms
[2026-05-24 06:47:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 195 labels/synchronizations in 78 ms.
[2026-05-24 06:47:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7616570511689478033.gal : 12 ms
[2026-05-24 06:47:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17323707110922810596.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/ReachabilityCardinality7616570511689478033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17323707110922810596.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality17323707110922810596.prop.
Detected timeout of ITS tools.
Starting property specific reduction for DoubleLock-PT-p2s2-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] 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-11026001746508787206.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7404273002987191174.kers'
[2026-05-24 06:48:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11026001746508787206.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7404273002987191174.kers]
Normalized transition count is 1021 out of 1536 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 143 cols 3906 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:48:15] [INFO ] Computed 3 invariants in 5 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7404273002987191174.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (102 resets) in 19 ms. (500 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2026-05-24 06:48:15] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3750127312105635420.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8030065865718782662.kers'
[2026-05-24 06:48:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3750127312105635420.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8030065865718782662.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 143 cols 3906 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:48:15] [INFO ] Computed 3 invariants in 4 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-8030065865718782662.kers
Total runtime 5 ms.
[2026-05-24 06:48:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:48:15] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-24 06:48:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:48:15] [INFO ] [Real]Added 112 Read/Feed constraints in 61 ms returned sat
[2026-05-24 06:48:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:48:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-24 06:48:16] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2026-05-24 06:48:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 136 ms returned sat
[2026-05-24 06:48:16] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 163 ms.
[2026-05-24 06:48:16] [INFO ] Added : 0 causal constraints over 0 iterations in 244 ms. Result :sat
Minimization took 501 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 143/143 places, 1536/1536 transitions.
[2026-05-24 06:48:17] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
findPositiveTsemiflow completed in 549 ms - Found solution {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1} and attempted to minimize in 0 ms success -> {18=1, 29=1, 722=1, 723=1, 1011=2}
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-7458249039421600867.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3658187141169962657.kers'
[2026-05-24 06:48:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7458249039421600867.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3658187141169962657.kers]
Normalized transition count is 1021 out of 1536 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 143 cols 3906 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:48:27] [INFO ] Computed 3 invariants in 4 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3658187141169962657.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000005 steps (10214 resets) in 1649 ms. (606 steps per ms)
BEST_FIRST walk for 1000001 steps (1910 resets) in 638 ms. (1564 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2026-05-24 06:48:30] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2737939325650889627.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15297157421661591631.kers'
[2026-05-24 06:48:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2737939325650889627.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15297157421661591631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1021 rows 143 cols 3906 entries
Finished phase 1 with 140 SingleSign rule and 0 generalized
[2026-05-24 06:48:30] [INFO ] Computed 3 invariants in 4 ms
Computed 3 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-15297157421661591631.kers
Total runtime 6 ms.
[2026-05-24 06:48:30] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-24 06:48:30] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2026-05-24 06:48:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 06:48:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-24 06:48:30] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2026-05-24 06:48:30] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:48:31] [INFO ] [Nat]Added 112 Read/Feed constraints in 233 ms returned sat
[2026-05-24 06:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2026-05-24 06:48:31] [INFO ] Computed and/alt/rep : 87/588/87 causal constraints (skipped 932 transitions) in 113 ms.
[2026-05-24 06:48:31] [INFO ] Added : 0 causal constraints over 0 iterations in 196 ms. Result :sat
Minimization took 675 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 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 26 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2026-05-24 06:48:32] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:48:32] [INFO ] Invariant cache hit.
[2026-05-24 06:48:32] [INFO ] Implicit Places using invariants in 325 ms returned []
[2026-05-24 06:48:33] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:48:33] [INFO ] Invariant cache hit.
[2026-05-24 06:48:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:48:34] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
[2026-05-24 06:48:34] [INFO ] Redundant transitions in 28 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2239 ms. Remains : 143/143 places, 1536/1536 transitions.
[2026-05-24 06:48:34] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
findPositiveTsemiflow completed in 659 ms - Found solution {18=1, 29=1, 693=1, 713=1, 980=1, 1001=1} and attempted to minimize in 1 ms success -> {18=1, 29=1, 722=1, 723=1, 1011=2}
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (408 resets) in 108 ms. (366 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (76 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2026-05-24 06:48:45] [INFO ] Flatten gal took : 72 ms
[2026-05-24 06:48:45] [INFO ] Flatten gal took : 78 ms
[2026-05-24 06:48:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14664050898218692213.gal : 21 ms
[2026-05-24 06:48:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10528699959874219916.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/ReachabilityCardinality14664050898218692213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10528699959874219916.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 ...330
Loading property file /tmp/ReachabilityCardinality10528699959874219916.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 83
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :83 after 660
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :660 after 2693
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2693 after 15278
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :15278 after 58661
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :58661 after 195171
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :195171 after 6.94454e+06
Interrupted probabilistic random walk after 416307 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 1
Probabilistic random walk after 416307 steps, saw 283403 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
[2026-05-24 06:48:48] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:48:48] [INFO ] Invariant cache hit.
[2026-05-24 06:48:48] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1115 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1115 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 78/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1115 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 78/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 705 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1152ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 143/143 places, 1536/1536 transitions.
RANDOM walk for 40013 steps (400 resets) in 106 ms. (373 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (75 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.94454e+06 after 2.70773e+07
Interrupted probabilistic random walk after 422623 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 422623 steps, saw 287628 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
[2026-05-24 06:48:53] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:48:53] [INFO ] Invariant cache hit.
[2026-05-24 06:48:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 50/1115 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1115 variables, 36/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 49/1164 variables, 40/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1164 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 78/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1164 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1164/1164 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1031/1065 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1065 variables, 34/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1065 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/1115 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/1164 variables, 40/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1164 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1164 variables, 78/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1164 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1164/1164 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 143/143 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1157ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 25 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 143/143 places, 1536/1536 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 1536/1536 transitions.
Applied a total of 0 rules in 24 ms. Remains 143 /143 variables (removed 0) and now considering 1536/1536 (removed 0) transitions.
[2026-05-24 06:48:54] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:48:54] [INFO ] Invariant cache hit.
[2026-05-24 06:48:54] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-24 06:48:54] [INFO ] Flow matrix only has 1021 transitions (discarded 515 similar events)
[2026-05-24 06:48:54] [INFO ] Invariant cache hit.
[2026-05-24 06:48:55] [INFO ] State equation strengthened by 112 read => feed constraints.
[2026-05-24 06:48:57] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 2775 ms to find 0 implicit places.
[2026-05-24 06:48:57] [INFO ] Redundant transitions in 28 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2834 ms. Remains : 143/143 places, 1536/1536 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 515 transitions
Reduce isomorphic transitions removed 515 transitions.
Iterating post reduction 0 with 515 rules applied. Total rules applied 515 place count 143 transition count 1021
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 515 place count 143 transition count 1011
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 535 place count 133 transition count 1011
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 541 place count 130 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 542 place count 129 transition count 976
Iterating global reduction 1 with 1 rules applied. Total rules applied 543 place count 129 transition count 976
Applied a total of 543 rules in 38 ms. Remains 129 /143 variables (removed 14) and now considering 976/1536 (removed 560) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12799827656313808229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16680766008890258859.kers'
[2026-05-24 06:48:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12799827656313808229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16680766008890258859.kers]
Culled 0 columns in 4 ms.
// Phase 1: matrix 976 rows 129 cols 3752 entries
Finished phase 1 with 126 SingleSign rule and 0 generalized
[2026-05-24 06:48:57] [INFO ] Computed 3 invariants in 8 ms
Computed 3 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16680766008890258859.kers
Total runtime 10 ms.
[2026-05-24 06:48:57] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2026-05-24 06:48:57] [INFO ] After 329ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 06:48:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-24 06:48:57] [INFO ] After 265ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 06:48:58] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 06:48:58] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 06:48:58] [INFO ] Flatten gal took : 29 ms
[2026-05-24 06:48:58] [INFO ] Flatten gal took : 27 ms
[2026-05-24 06:48:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9833943378973367510.gal : 8 ms
[2026-05-24 06:48:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18176069242091250451.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/ReachabilityCardinality9833943378973367510.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18176069242091250451.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/ReachabilityCardinality18176069242091250451.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 36
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :36 after 325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :325 after 3102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3102 after 35893
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :35893 after 86745
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86745 after 172257
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :172257 after 322656
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.70773e+07 after 6.72957e+07
Detected timeout of ITS tools.
[2026-05-24 06:49:13] [INFO ] Flatten gal took : 26 ms
[2026-05-24 06:49:13] [INFO ] Applying decomposition
[2026-05-24 06:49:13] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph13707029670722538195.txt' '-o' '/tmp/graph13707029670722538195.bin' '-w' '/tmp/graph13707029670722538195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13707029670722538195.bin' '-l' '-1' '-v' '-w' '/tmp/graph13707029670722538195.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:49:13] [INFO ] Decomposing Gal with order
[2026-05-24 06:49:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:49:13] [INFO ] Removed a total of 2247 redundant transitions.
[2026-05-24 06:49:13] [INFO ] Flatten gal took : 67 ms
[2026-05-24 06:49:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 34 ms.
[2026-05-24 06:49:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3085859203830588734.gal : 6 ms
[2026-05-24 06:49:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15092100956293831268.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/ReachabilityCardinality3085859203830588734.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15092100956293831268.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality15092100956293831268.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 33
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :33 after 2353
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2353 after 5883
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5883 after 5963
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :5963 after 1.29122e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.29122e+06 after 2.00796e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.00796e+06 after 2.45953e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.45953e+07 after 3.78358e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31282 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 06:49:28] [INFO ] Flatten gal took : 35 ms
[2026-05-24 06:49:28] [INFO ] Applying decomposition
[2026-05-24 06:49:28] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11773528402102950271.txt' '-o' '/tmp/graph11773528402102950271.bin' '-w' '/tmp/graph11773528402102950271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11773528402102950271.bin' '-l' '-1' '-v' '-w' '/tmp/graph11773528402102950271.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:49:28] [INFO ] Decomposing Gal with order
[2026-05-24 06:49:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:49:28] [INFO ] Removed a total of 3594 redundant transitions.
[2026-05-24 06:49:28] [INFO ] Flatten gal took : 83 ms
[2026-05-24 06:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 35 ms.
[2026-05-24 06:49:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13767457216180374250.gal : 7 ms
[2026-05-24 06:49:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2589035976911768846.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/ReachabilityCardinality13767457216180374250.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2589035976911768846.prop' '--nowitness'
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 ...308
Loading property file /tmp/ReachabilityCardinality2589035976911768846.prop.
Detected timeout of ITS tools.
Ending property specific reduction for DoubleLock-PT-p2s2-UpperBounds-08 in 123687 ms.
[2026-05-24 06:50:19] [INFO ] Flatten gal took : 34 ms
[2026-05-24 06:50:19] [INFO ] Applying decomposition
[2026-05-24 06:50:19] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5397656955193173865.txt' '-o' '/tmp/graph5397656955193173865.bin' '-w' '/tmp/graph5397656955193173865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5397656955193173865.bin' '-l' '-1' '-v' '-w' '/tmp/graph5397656955193173865.weights' '-q' '0' '-e' '0.001'
[2026-05-24 06:50:19] [INFO ] Decomposing Gal with order
[2026-05-24 06:50:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 06:50:19] [INFO ] Removed a total of 3594 redundant transitions.
[2026-05-24 06:50:19] [INFO ] Flatten gal took : 83 ms
[2026-05-24 06:50:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 223 labels/synchronizations in 31 ms.
[2026-05-24 06:50:19] [INFO ] Time to serialize gal into /tmp/UpperBounds906751194857482553.gal : 9 ms
[2026-05-24 06:50:19] [INFO ] Time to serialize properties into /tmp/UpperBounds18222162709848961824.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/UpperBounds906751194857482553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18222162709848961824.prop' '--nowitness'
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 ...283
Loading property file /tmp/UpperBounds18222162709848961824.prop.
Detected timeout of ITS tools.
[2026-05-24 07:12:33] [INFO ] Flatten gal took : 34 ms
[2026-05-24 07:12:33] [INFO ] Time to serialize gal into /tmp/UpperBounds17054735222109200849.gal : 8 ms
[2026-05-24 07:12:33] [INFO ] Time to serialize properties into /tmp/UpperBounds14059061763257248760.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/UpperBounds17054735222109200849.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds14059061763257248760.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 ...306
Loading property file /tmp/UpperBounds14059061763257248760.prop.
Detected timeout of ITS tools.
[2026-05-24 07:34:48] [INFO ] Flatten gal took : 31 ms
[2026-05-24 07:34:48] [INFO ] Input system was already deterministic with 1536 transitions.
[2026-05-24 07:34:48] [INFO ] Transformed 143 places.
[2026-05-24 07:34:48] [INFO ] Transformed 1536 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 07:34:48] [INFO ] Time to serialize gal into /tmp/UpperBounds6979461461284149826.gal : 6 ms
[2026-05-24 07:34:48] [INFO ] Time to serialize properties into /tmp/UpperBounds7810229386638207358.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/UpperBounds6979461461284149826.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7810229386638207358.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7810229386638207358.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="DoubleLock-PT-p2s2"
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 DoubleLock-PT-p2s2, 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 r114-smll-177955740400037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p2s2.tgz
mv DoubleLock-PT-p2s2 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 ;