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.r056-smll-177946903000328.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 CloudDeployment-PT-7b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-smll-177946903000328
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 7.4K Mar 6 11:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 6 11:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 6 11:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 6 11:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 11:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 6 11:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Mar 6 11:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 6 11:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 20M 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1779479847535

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-7b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202604301425
[2026-05-22 19:57:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-22 19:57:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:57:31] [INFO ] Load time of PNML (sax parser for PT used): 1770 ms
[2026-05-22 19:57:31] [INFO ] Transformed 2271 places.
[2026-05-22 19:57:32] [INFO ] Transformed 19752 transitions.
[2026-05-22 19:57:32] [INFO ] Found NUPN structural information;
[2026-05-22 19:57:32] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 2178 ms.
Graph (trivial) has 2288 edges and 2271 vertex of which 588 / 2271 are part of one of the 56 SCC in 34 ms
Free SCC test removed 532 places
Structural test allowed to assert that 747 places are NOT stable. Took 199 ms.
Ensure Unique test removed 595 transitions
Reduce redundant transitions removed 595 transitions.
RANDOM walk for 40000 steps (198 resets) in 9693 ms. (4 steps per ms) remains 729/1524 properties
BEST_FIRST walk for 121 steps (8 resets) in 21 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 19 ms. (6 steps per ms) remains 729/729 properties
BEST_FIRST walk for 120 steps (8 resets) in 16 ms. (7 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 24 ms. (4 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 21 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 50 ms. (2 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 22 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 21 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 729/729 properties
BEST_FIRST walk for 120 steps (8 resets) in 20 ms. (5 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 19 ms. (6 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 14 ms. (8 steps per ms) remains 729/729 properties
BEST_FIRST walk for 120 steps (8 resets) in 18 ms. (6 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 25 ms. (4 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 27 ms. (4 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 14 ms. (8 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 26 ms. (4 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 14 ms. (8 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 27 ms. (4 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 11 ms. (10 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 95 ms. (1 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 7 ms. (15 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 13 ms. (8 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 33 ms. (3 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 729/729 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 729/729 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 14 ms. (8 steps per ms) remains 729/729 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 729/729 properties
BEST_FIRST walk for 122 steps (8 resets) in 20 ms. (5 steps per ms) remains 729/729 properties
[2026-05-22 19:57:36] [INFO ] Flow matrix only has 19102 transitions (discarded 55 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8034958884860653710.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9064784172942039707.kers'
[2026-05-22 19:57:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8034958884860653710.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9064784172942039707.kers]
Normalized transition count is 19101 out of 19102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 113 ms.
// Phase 1: matrix 19101 rows 1738 cols 371979 entries
Finished phase 1 with 1707 SingleSign rule and 3 generalized
[2026-05-22 19:57:39] [INFO ] Computed 29 invariants in 657 ms
Computed 29 P flows in 663 ms.
Exported basis to /tmp/petrispot-output-9064784172942039707.kers
Total runtime 760 ms.
[2026-05-22 19:57:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2026-05-22 19:57:41] [INFO ] Flatten gal took : 6415 ms
[2026-05-22 19:57:44] [INFO ] Flatten gal took : 3368 ms
[2026-05-22 19:57:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14179903724113485789.gal : 640 ms
[2026-05-22 19:57:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5643087047004448188.prop : 11 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/ReachabilityCardinality14179903724113485789.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5643087047004448188.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
At refinement iteration 0 (INCLUDED_ONLY) 0/729 variables, 729/729 constraints. Problems are: Problem set: 0 solved, 729 unsolved
SMT process timed out in 11903ms, After SMT, problems are : Problem set: 0 solved, 729 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 729 out of 1739 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1739/1739 places, 19157/19157 transitions.
Graph (complete) has 5472 edges and 1739 vertex of which 1735 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.101 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 521 rules applied. Total rules applied 522 place count 1735 transition count 18634
Reduce places removed 463 places and 0 transitions.
Iterating post reduction 1 with 463 rules applied. Total rules applied 985 place count 1272 transition count 18634
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 985 place count 1272 transition count 18625
Deduced a syphon composed of 9 places in 15 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1003 place count 1263 transition count 18625
Discarding 260 places :
Symmetric choice reduction at 2 with 260 rule applications. Total rules 1263 place count 1003 transition count 18365
Iterating global reduction 2 with 260 rules applied. Total rules applied 1523 place count 1003 transition count 18365
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 1555 place count 1003 transition count 18333
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 9 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 130 rules applied. Total rules applied 1685 place count 938 transition count 18268
Performed 35 Post agglomeration using F-continuation condition with reduction of 42 identical transitions.
Deduced a syphon composed of 35 places in 22 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1755 place count 903 transition count 18310
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 1763 place count 903 transition count 18302
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1777 place count 896 transition count 18386
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 1805 place count 896 transition count 18358
Free-agglomeration rule applied 77 times with reduction of 34 identical transitions.
Iterating global reduction 4 with 77 rules applied. Total rules applied 1882 place count 896 transition count 18247
Reduce places removed 77 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 167 transitions
Reduce isomorphic transitions removed 167 transitions.
Iterating post reduction 4 with 244 rules applied. Total rules applied 2126 place count 819 transition count 18080
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 5 with 28 rules applied. Total rules applied 2154 place count 819 transition count 18052
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2155 place count 819 transition count 18052
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2157 place count 819 transition count 18052
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2159 place count 819 transition count 18050
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2160 place count 818 transition count 18049
Applied a total of 2160 rules in 7845 ms. Remains 818 /1739 variables (removed 921) and now considering 18049/19157 (removed 1108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7873 ms. Remains : 818/1739 places, 18049/19157 transitions.
RANDOM walk for 450155 steps (0 resets) in 120006 ms. (3 steps per ms) remains 579/729 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 140 ms. (28 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 579/579 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 579/579 properties
[2026-05-22 19:58:26] [INFO ] Flow matrix only has 18040 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16011131530759624638.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8334538342407207677.kers'
[2026-05-22 19:58:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16011131530759624638.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8334538342407207677.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 64 ms.
// Phase 1: matrix 18040 rows 817 cols 369098 entries
Finished phase 1 with 786 SingleSign rule and 3 generalized
[2026-05-22 19:58:27] [INFO ] Computed 29 invariants in 379 ms
Computed 29 P flows in 381 ms.
Exported basis to /tmp/petrispot-output-8334538342407207677.kers
Total runtime 433 ms.
Loading property file /tmp/ReachabilityCardinality5643087047004448188.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (OVERLAPS) 227/806 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/806 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 4 (OVERLAPS) 12/818 variables, 6/29 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/18858 variables, and 29 constraints, problems are : Problem set: 0 solved, 579 unsolved in 45046 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 579/563 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 579 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/579 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/579 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 579 unsolved
At refinement iteration 2 (OVERLAPS) 227/806 variables, 22/23 constraints. Problems are: Problem set: 0 solved, 579 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 806/18858 variables, and 23 constraints, problems are : Problem set: 0 solved, 579 unsolved in 45050 ms.
Refiners :[Generalized P Invariants (flows): 23/29 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 16/563 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 92185ms problems are : Problem set: 0 solved, 579 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 579 out of 818 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 818/818 places, 18049/18049 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 818 transition count 17993
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 762 transition count 17993
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 112 place count 762 transition count 17984
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 130 place count 753 transition count 17984
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 156 place count 727 transition count 17955
Iterating global reduction 2 with 26 rules applied. Total rules applied 182 place count 727 transition count 17955
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 183 place count 727 transition count 17954
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 186 place count 724 transition count 17951
Iterating global reduction 3 with 3 rules applied. Total rules applied 189 place count 724 transition count 17951
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 192 place count 721 transition count 17948
Iterating global reduction 3 with 3 rules applied. Total rules applied 195 place count 721 transition count 17948
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 197 place count 719 transition count 17946
Iterating global reduction 3 with 2 rules applied. Total rules applied 199 place count 719 transition count 17946
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 718 transition count 17945
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 718 transition count 17945
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 202 place count 717 transition count 17944
Iterating global reduction 3 with 1 rules applied. Total rules applied 203 place count 717 transition count 17944
Performed 25 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 25 places in 3 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 253 place count 692 transition count 17918
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 283 place count 692 transition count 17888
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 287 place count 690 transition count 17910
Drop transitions (Redundant composition of simpler transitions.) removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 4 with 77 rules applied. Total rules applied 364 place count 690 transition count 17833
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 366 place count 690 transition count 50604
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 369 place count 688 transition count 50603
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 371 place count 688 transition count 50603
Applied a total of 371 rules in 4484 ms. Remains 688 /818 variables (removed 130) and now considering 50603/18049 (removed -32554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4484 ms. Remains : 688/818 places, 50603/18049 transitions.
RANDOM walk for 247775 steps (2842 resets) in 120011 ms. (2 steps per ms) remains 68/579 properties
BEST_FIRST walk for 385159 steps (517 resets) in 19618 ms. (19 steps per ms) remains 68/68 properties
BEST_FIRST walk for 393485 steps (524 resets) in 19965 ms. (19 steps per ms) remains 66/68 properties
BEST_FIRST walk for 379645 steps (511 resets) in 19833 ms. (19 steps per ms) remains 64/66 properties
BEST_FIRST walk for 370752 steps (488 resets) in 20015 ms. (18 steps per ms) remains 60/64 properties
BEST_FIRST walk for 386551 steps (513 resets) in 19676 ms. (19 steps per ms) remains 58/60 properties
SDD proceeding with computation,729 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,729 properties remain. new max is 8
SDD size :5 after 10
BEST_FIRST walk for 388127 steps (513 resets) in 19843 ms. (19 steps per ms) remains 56/58 properties
SDD proceeding with computation,729 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,729 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,729 properties remain. new max is 64
SDD size :22 after 40
SDD proceeding with computation,729 properties remain. new max is 128
SDD size :40 after 209
BEST_FIRST walk for 369062 steps (491 resets) in 20011 ms. (18 steps per ms) remains 56/56 properties
SDD proceeding with computation,729 properties remain. new max is 256
SDD size :209 after 930
SDD proceeding with computation,729 properties remain. new max is 512
SDD size :930 after 1210
BEST_FIRST walk for 371077 steps (495 resets) in 20009 ms. (18 steps per ms) remains 54/56 properties
SDD proceeding with computation,729 properties remain. new max is 1024
SDD size :1210 after 36069
BEST_FIRST walk for 378276 steps (502 resets) in 19980 ms. (18 steps per ms) remains 54/54 properties
BEST_FIRST walk for 392489 steps (526 resets) in 19510 ms. (20 steps per ms) remains 54/54 properties
BEST_FIRST walk for 364991 steps (483 resets) in 20012 ms. (18 steps per ms) remains 54/54 properties
BEST_FIRST walk for 373032 steps (489 resets) in 20007 ms. (18 steps per ms) remains 52/54 properties
BEST_FIRST walk for 385041 steps (521 resets) in 20013 ms. (19 steps per ms) remains 52/52 properties
SDD proceeding with computation,729 properties remain. new max is 2048
SDD size :36069 after 246301
SDD proceeding with computation,729 properties remain. new max is 4096
SDD size :246301 after 287743
BEST_FIRST walk for 394704 steps (524 resets) in 19926 ms. (19 steps per ms) remains 52/52 properties
BEST_FIRST walk for 366193 steps (481 resets) in 20010 ms. (18 steps per ms) remains 50/52 properties
BEST_FIRST walk for 360424 steps (484 resets) in 20008 ms. (18 steps per ms) remains 50/50 properties
BEST_FIRST walk for 376467 steps (502 resets) in 20011 ms. (18 steps per ms) remains 48/50 properties
BEST_FIRST walk for 375061 steps (498 resets) in 20005 ms. (18 steps per ms) remains 46/48 properties
BEST_FIRST walk for 369461 steps (484 resets) in 20005 ms. (18 steps per ms) remains 44/46 properties
BEST_FIRST walk for 302560 steps (389 resets) in 20011 ms. (15 steps per ms) remains 44/44 properties
BEST_FIRST walk for 324324 steps (431 resets) in 20015 ms. (16 steps per ms) remains 44/44 properties
BEST_FIRST walk for 348688 steps (462 resets) in 20006 ms. (17 steps per ms) remains 40/44 properties
BEST_FIRST walk for 342909 steps (462 resets) in 20006 ms. (17 steps per ms) remains 40/40 properties
BEST_FIRST walk for 341743 steps (458 resets) in 20011 ms. (17 steps per ms) remains 40/40 properties
SDD proceeding with computation,729 properties remain. new max is 8192
SDD size :287743 after 1.94902e+06
BEST_FIRST walk for 344875 steps (463 resets) in 20015 ms. (17 steps per ms) remains 40/40 properties
BEST_FIRST walk for 347830 steps (461 resets) in 20005 ms. (17 steps per ms) remains 40/40 properties
BEST_FIRST walk for 365126 steps (488 resets) in 20010 ms. (18 steps per ms) remains 38/40 properties
BEST_FIRST walk for 356779 steps (484 resets) in 20014 ms. (17 steps per ms) remains 38/38 properties
BEST_FIRST walk for 341846 steps (457 resets) in 20008 ms. (17 steps per ms) remains 38/38 properties
BEST_FIRST walk for 358336 steps (482 resets) in 20011 ms. (17 steps per ms) remains 38/38 properties
BEST_FIRST walk for 352719 steps (465 resets) in 20012 ms. (17 steps per ms) remains 38/38 properties
BEST_FIRST walk for 360052 steps (483 resets) in 20017 ms. (17 steps per ms) remains 38/38 properties
BEST_FIRST walk for 354089 steps (464 resets) in 20013 ms. (17 steps per ms) remains 38/38 properties
SDD proceeding with computation,729 properties remain. new max is 16384
SDD size :1.94902e+06 after 4.63394e+06
BEST_FIRST walk for 351989 steps (468 resets) in 20008 ms. (17 steps per ms) remains 38/38 properties
BEST_FIRST walk for 367933 steps (474 resets) in 19984 ms. (18 steps per ms) remains 38/38 properties
BEST_FIRST walk for 377246 steps (498 resets) in 20006 ms. (18 steps per ms) remains 38/38 properties
BEST_FIRST walk for 322163 steps (424 resets) in 20013 ms. (16 steps per ms) remains 38/38 properties
SDD proceeding with computation,729 properties remain. new max is 32768
SDD size :4.63394e+06 after 4.79074e+06
BEST_FIRST walk for 318708 steps (421 resets) in 20008 ms. (15 steps per ms) remains 38/38 properties
BEST_FIRST walk for 305830 steps (406 resets) in 20012 ms. (15 steps per ms) remains 32/38 properties
BEST_FIRST walk for 300720 steps (389 resets) in 20023 ms. (15 steps per ms) remains 32/32 properties
[2026-05-22 20:03:53] [INFO ] Flow matrix only has 50589 transitions (discarded 14 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5574485683637337101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16448319405260758722.kers'
[2026-05-22 20:03:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5574485683637337101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16448319405260758722.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 207 ms.
// Phase 1: matrix 50589 rows 687 cols 1088292 entries
Finished phase 1 with 656 SingleSign rule and 3 generalized
[2026-05-22 20:03:55] [INFO ] Computed 29 invariants in 1385 ms
Computed 29 P flows in 1389 ms.
Exported basis to /tmp/petrispot-output-16448319405260758722.kers
Total runtime 1551 ms.
[2026-05-22 20:03:55] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 642/674 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 14/688 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 50589/51277 variables, 688/717 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51277 variables, 7/724 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 51277/51277 variables, and 724 constraints, problems are : Problem set: 0 solved, 32 unsolved in 75057 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 688/688 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 32/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 642/674 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 14/688 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 50589/51277 variables, 688/717 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 152777ms, After SMT, problems are : Problem set: 0 solved, 32 unsolved
Fused 32 Parikh solutions to 9 different solutions.
Parikh walk visited 26 properties in 9561 ms.
Support contains 6 out of 688 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 688/688 places, 50603/50603 transitions.
Graph (complete) has 3156 edges and 688 vertex of which 656 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.11 ms
Discarding 32 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 49177 transitions
Reduce isomorphic transitions removed 49177 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 49447 rules applied. Total rules applied 49448 place count 656 transition count 1151
Reduce places removed 270 places and 0 transitions.
Iterating post reduction 1 with 270 rules applied. Total rules applied 49718 place count 386 transition count 1151
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 49718 place count 386 transition count 1126
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 49768 place count 361 transition count 1126
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 49838 place count 291 transition count 1052
Iterating global reduction 2 with 70 rules applied. Total rules applied 49908 place count 291 transition count 1052
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 49957 place count 291 transition count 1003
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 49957 place count 291 transition count 996
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 49971 place count 284 transition count 996
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49972 place count 283 transition count 995
Iterating global reduction 3 with 1 rules applied. Total rules applied 49973 place count 283 transition count 995
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 50117 place count 211 transition count 923
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 50126 place count 211 transition count 914
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50127 place count 210 transition count 913
Iterating global reduction 4 with 1 rules applied. Total rules applied 50128 place count 210 transition count 913
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50129 place count 209 transition count 912
Iterating global reduction 4 with 1 rules applied. Total rules applied 50130 place count 209 transition count 912
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50131 place count 208 transition count 911
Iterating global reduction 4 with 1 rules applied. Total rules applied 50132 place count 208 transition count 911
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50133 place count 207 transition count 910
Iterating global reduction 4 with 1 rules applied. Total rules applied 50134 place count 207 transition count 910
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: -243
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 50184 place count 182 transition count 1153
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 50200 place count 182 transition count 1137
Drop transitions (Redundant composition of simpler transitions.) removed 294 transitions
Redundant transition composition rules discarded 294 transitions
Iterating global reduction 5 with 294 rules applied. Total rules applied 50494 place count 182 transition count 843
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 50501 place count 182 transition count 836
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 50564 place count 175 transition count 780
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 50571 place count 168 transition count 724
Iterating global reduction 6 with 7 rules applied. Total rules applied 50578 place count 168 transition count 724
Applied a total of 50578 rules in 348 ms. Remains 168 /688 variables (removed 520) and now considering 724/50603 (removed 49879) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 168/688 places, 724/50603 transitions.
RANDOM walk for 4000000 steps (46874 resets) in 25058 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5114 resets) in 5243 ms. (762 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5125 resets) in 5477 ms. (730 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5118 resets) in 5437 ms. (735 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5147 resets) in 5266 ms. (759 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5128 resets) in 5570 ms. (718 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5115 resets) in 5346 ms. (748 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 5311860 steps, run timeout after 48001 ms. (steps per millisecond=110 ) properties seen :0 out of 6
Probabilistic random walk after 5311860 steps, saw 767170 distinct states, run finished after 48016 ms. (steps per millisecond=110 ) properties seen :0
[2026-05-22 20:07:40] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10855740381219891527.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17977751125103430761.kers'
[2026-05-22 20:07:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10855740381219891527.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17977751125103430761.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 339 rows 155 cols 1134 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-22 20:07:40] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17977751125103430761.kers
Total runtime 2 ms.
[2026-05-22 20:07:40] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 134/182 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 183/365 variables, 51/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 20/385 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 83/468 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 37/505 variables, 21/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/507 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 201 constraints, problems are : Problem set: 0 solved, 6 unsolved in 537 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 134/182 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 183/365 variables, 51/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/385 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 83/468 variables, 46/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 37/505 variables, 21/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 7/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/507 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/507 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2045 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2598ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Applied a total of 0 rules in 23 ms. Remains 168 /168 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 168/168 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Applied a total of 0 rules in 23 ms. Remains 168 /168 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2026-05-22 20:07:43] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:07:43] [INFO ] Invariant cache hit.
[2026-05-22 20:07:43] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-22 20:07:43] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:07:43] [INFO ] Invariant cache hit.
[2026-05-22 20:07:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:07:44] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2026-05-22 20:07:44] [INFO ] Redundant transitions in 71 ms returned []
Running 675 sub problems to find dead transitions.
[2026-05-22 20:07:44] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:07:44] [INFO ] Invariant cache hit.
[2026-05-22 20:07:44] [INFO ] State equation strengthened by 9 read => feed constraints.
Detected timeout of ITS tools.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 675 unsolved
[2026-05-22 20:07:49] [INFO ] Flatten gal took : 3848 ms
[2026-05-22 20:07:49] [INFO ] Applying decomposition
[2026-05-22 20:07:52] [INFO ] Flatten gal took : 3162 ms
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 7/168 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 675 unsolved
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/graph15259493127184525249.txt' '-o' '/tmp/graph15259493127184525249.bin' '-w' '/tmp/graph15259493127184525249.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15259493127184525249.bin' '-l' '-1' '-v' '-w' '/tmp/graph15259493127184525249.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:07:58] [INFO ] Decomposing Gal with order
[2026-05-22 20:07:58] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 6 (OVERLAPS) 339/507 variables, 168/193 constraints. Problems are: Problem set: 0 solved, 675 unsolved
SMT process timed out in 30973ms, After SMT, problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 30985ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32060 ms. Remains : 168/168 places, 724/724 transitions.
RANDOM walk for 400000 steps (4670 resets) in 5586 ms. (71 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2026-05-22 20:08:16] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:08:16] [INFO ] Invariant cache hit.
[2026-05-22 20:08:16] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-22 20:08:16] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 10 ms returned sat
[2026-05-22 20:08:17] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2026-05-22 20:08:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:08:17] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 20:08:17] [INFO ] After 194ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 20:08:17] [INFO ] After 463ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 20:08:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2026-05-22 20:08:17] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 30 ms returned sat
[2026-05-22 20:08:17] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2026-05-22 20:08:17] [INFO ] After 40ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 20:08:17] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 20:08:17] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 4000000 steps (46929 resets) in 27592 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5102 resets) in 5306 ms. (753 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5107 resets) in 5669 ms. (705 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5124 resets) in 5443 ms. (734 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5115 resets) in 5515 ms. (725 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000003 steps (5093 resets) in 5851 ms. (683 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (5114 resets) in 5233 ms. (764 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 5117040 steps, run timeout after 48001 ms. (steps per millisecond=106 ) properties seen :0 out of 6
Probabilistic random walk after 5117040 steps, saw 742786 distinct states, run finished after 48002 ms. (steps per millisecond=106 ) properties seen :0
[2026-05-22 20:09:22] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:09:22] [INFO ] Invariant cache hit.
[2026-05-22 20:09:22] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 134/182 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 183/365 variables, 51/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 14/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 20/385 variables, 7/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 83/468 variables, 46/169 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/468 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/468 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 37/505 variables, 21/192 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/505 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/505 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 2/507 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 201 constraints, problems are : Problem set: 0 solved, 6 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 134/182 variables, 48/51 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 183/365 variables, 51/105 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 14/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 20/385 variables, 7/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 83/468 variables, 46/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/468 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 37/505 variables, 21/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/505 variables, 7/205 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 2/507 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/507 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1525 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2136ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Applied a total of 0 rules in 20 ms. Remains 168 /168 variables (removed 0) and now considering 724/724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 168/168 places, 724/724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Applied a total of 0 rules in 17 ms. Remains 168 /168 variables (removed 0) and now considering 724/724 (removed 0) transitions.
[2026-05-22 20:09:24] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:09:24] [INFO ] Invariant cache hit.
[2026-05-22 20:09:25] [INFO ] Implicit Places using invariants in 259 ms returned []
[2026-05-22 20:09:25] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:09:25] [INFO ] Invariant cache hit.
[2026-05-22 20:09:25] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:09:25] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2026-05-22 20:09:25] [INFO ] Redundant transitions in 15 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 939 ms. Remains : 168/168 places, 724/724 transitions.
RANDOM walk for 400000 steps (4697 resets) in 3267 ms. (122 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2026-05-22 20:09:26] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:09:26] [INFO ] Invariant cache hit.
[2026-05-22 20:09:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2026-05-22 20:09:26] [INFO ] [Real]Absence check using 3 positive and 21 generalized place invariants in 12 ms returned sat
[2026-05-22 20:09:26] [INFO ] After 157ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2026-05-22 20:09:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:09:27] [INFO ] After 27ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 20:09:27] [INFO ] After 184ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 20:09:27] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 20:09:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2026-05-22 20:09:27] [INFO ] [Nat]Absence check using 3 positive and 21 generalized place invariants in 9 ms returned sat
[2026-05-22 20:09:27] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2026-05-22 20:09:27] [INFO ] After 39ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 20:09:27] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 20:09:27] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 40000 steps (474 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (47 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 329660 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 329660 steps, saw 61189 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2026-05-22 20:09:30] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
[2026-05-22 20:09:30] [INFO ] Invariant cache hit.
[2026-05-22 20:09:30] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/314 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/340 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/360 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/468 variables, 71/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 37/505 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/507 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/507 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/507 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 735 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 255/314 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/340 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/360 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/468 variables, 71/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2026-05-22 20:09:31] [INFO ] Removed a total of 175186 redundant transitions.
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/468 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 37/505 variables, 21/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/505 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/507 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/507 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/507 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 206 constraints, problems are : Problem set: 0 solved, 1 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1586ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 719
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 163 transition count 719
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 158 transition count 714
Applied a total of 20 rules in 30 ms. Remains 158 /168 variables (removed 10) and now considering 714/724 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 158/168 places, 714/724 transitions.
RANDOM walk for 40000 steps (482 resets) in 382 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 76 ms. (519 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 321542 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 321542 steps, saw 60033 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-22 20:09:35] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7283802501206364223.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16981504747666360364.kers'
[2026-05-22 20:09:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7283802501206364223.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16981504747666360364.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 329 rows 145 cols 1094 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-22 20:09:35] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16981504747666360364.kers
Total runtime 6 ms.
[2026-05-22 20:09:35] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/254 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/274 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/385 variables, 45/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 18/403 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 76/479 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/487 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/487 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/487 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 195/254 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/274 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 111/385 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/403 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/479 variables, 45/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/479 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/487 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1181ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 18 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 158/158 places, 714/714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 17 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-22 20:09:36] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:09:36] [INFO ] Invariant cache hit.
[2026-05-22 20:09:36] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-22 20:09:36] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:09:36] [INFO ] Invariant cache hit.
[2026-05-22 20:09:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:09:37] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2026-05-22 20:09:37] [INFO ] Redundant transitions in 26 ms returned []
Running 665 sub problems to find dead transitions.
[2026-05-22 20:09:37] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:09:37] [INFO ] Invariant cache hit.
[2026-05-22 20:09:37] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:09:40] [INFO ] Flatten gal took : 97681 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (OVERLAPS) 7/158 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (OVERLAPS) 329/487 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 665 unsolved
[2026-05-22 20:10:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 32914 labels/synchronizations in 13027 ms.
[2026-05-22 20:10:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9249093870707978071.gal : 307 ms
[2026-05-22 20:10:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2326316942252357139.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/ReachabilityCardinality9249093870707978071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2326316942252357139.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 ...307
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 9/191 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/487 variables, and 191 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 665/663 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 14/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (OVERLAPS) 7/158 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (OVERLAPS) 329/487 variables, 158/182 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Loading property file /tmp/ReachabilityCardinality2326316942252357139.prop.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 9/191 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 663/854 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/487 variables, and 854 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 665/663 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60935ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61918 ms. Remains : 158/158 places, 714/714 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 158 vertex of which 56 / 158 are part of one of the 7 SCC in 1 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 227
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 74 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 74 transition count 215
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 62 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 56 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 56 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 50 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 50 transition count 167
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 50 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 43 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 43 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 36 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 36 transition count 71
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 36 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 289 place count 25 transition count 65
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 321 place count 25 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 24 transition count 32
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 330 place count 24 transition count 32
Applied a total of 330 rules in 19 ms. Remains 24 /158 variables (removed 134) and now considering 32/714 (removed 682) 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-2211980654271929053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9719817749733062002.kers'
[2026-05-22 20:10:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2211980654271929053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9719817749733062002.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 24 cols 155 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-22 20:10:38] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9719817749733062002.kers
Total runtime 1 ms.
[2026-05-22 20:10:38] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:10:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 20:10:38] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-22 20:10:38] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:10:38] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:10:38] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 114 ms.
RANDOM walk for 40000 steps (469 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327773 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 327773 steps, saw 60850 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2026-05-22 20:10:41] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13448833338692571913.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2690934790787626573.kers'
[2026-05-22 20:10:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13448833338692571913.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2690934790787626573.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 339 rows 155 cols 1134 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-22 20:10:41] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2690934790787626573.kers
Total runtime 3 ms.
[2026-05-22 20:10:41] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 213/235 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/274 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/315 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 160/475 variables, 100/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/505 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/507 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 213/235 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/274 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/315 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/475 variables, 100/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 30/505 variables, 17/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/507 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 761 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1012ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 719
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 163 transition count 719
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 158 transition count 714
Applied a total of 20 rules in 27 ms. Remains 158 /168 variables (removed 10) and now considering 714/724 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 158/168 places, 714/724 transitions.
RANDOM walk for 40000 steps (476 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (53 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 324633 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 324633 steps, saw 60453 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2026-05-22 20:10:45] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12374405321257619878.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-690979941095282522.kers'
[2026-05-22 20:10:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12374405321257619878.kers, --Pflows, --basisKERS=/tmp/petrispot-output-690979941095282522.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 329 rows 145 cols 1094 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-22 20:10:45] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-690979941095282522.kers
Total runtime 2 ms.
[2026-05-22 20:10:45] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/175 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/216 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 169/385 variables, 71/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/412 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 69/481 variables, 48/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/481 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/481 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/487 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 153/175 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/216 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 169/385 variables, 71/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 27/412 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/481 variables, 48/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/481 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/487 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 856 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 27 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 158/158 places, 714/714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 18 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-22 20:10:47] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:10:47] [INFO ] Invariant cache hit.
[2026-05-22 20:10:47] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-22 20:10:47] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:10:47] [INFO ] Invariant cache hit.
[2026-05-22 20:10:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:10:47] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2026-05-22 20:10:47] [INFO ] Redundant transitions in 14 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 866 ms. Remains : 158/158 places, 714/714 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 158 vertex of which 56 / 158 are part of one of the 7 SCC in 1 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 227
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 74 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 74 transition count 215
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 62 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 56 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 56 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 50 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 50 transition count 167
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 50 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 43 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 43 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 36 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 36 transition count 71
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 36 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 289 place count 25 transition count 65
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 321 place count 25 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 24 transition count 32
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 330 place count 24 transition count 32
Applied a total of 330 rules in 16 ms. Remains 24 /158 variables (removed 134) and now considering 32/714 (removed 682) 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-16230110736478358101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1133180028151562344.kers'
[2026-05-22 20:10:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16230110736478358101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1133180028151562344.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 24 cols 155 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-22 20:10:48] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1133180028151562344.kers
Total runtime 1 ms.
[2026-05-22 20:10:48] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:10:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 20:10:48] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-22 20:10:48] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:10:48] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:10:48] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 107 ms.
RANDOM walk for 40000 steps (478 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (51 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1 after 129263
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :129263 after 129263
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :129263 after 2.00496e+08
Interrupted probabilistic random walk after 324084 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 324084 steps, saw 60236 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-22 20:10:51] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14640092310190850144.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1131235940862324972.kers'
[2026-05-22 20:10:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14640092310190850144.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1131235940862324972.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 339 rows 155 cols 1134 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-22 20:10:51] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1131235940862324972.kers
Total runtime 2 ms.
[2026-05-22 20:10:51] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 213/235 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/274 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/315 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 157/472 variables, 99/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/472 variables, 2/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/472 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 33/505 variables, 18/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/507 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 237 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 213/235 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/274 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/315 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 157/472 variables, 99/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/472 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/472 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 33/505 variables, 18/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/507 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/507 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/507 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 788ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 719
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 163 transition count 719
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 158 transition count 714
Applied a total of 20 rules in 26 ms. Remains 158 /168 variables (removed 10) and now considering 714/724 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 158/168 places, 714/724 transitions.
RANDOM walk for 40000 steps (475 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (51 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 333608 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 333608 steps, saw 61670 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2026-05-22 20:10:55] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6168385564952538450.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-759789324443374472.kers'
[2026-05-22 20:10:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6168385564952538450.kers, --Pflows, --basisKERS=/tmp/petrispot-output-759789324443374472.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 329 rows 145 cols 1094 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-22 20:10:55] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-759789324443374472.kers
Total runtime 2 ms.
[2026-05-22 20:10:55] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/175 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/216 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 165/381 variables, 70/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/408 variables, 3/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 73/481 variables, 49/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/481 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/481 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/487 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 153/175 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/216 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 165/381 variables, 70/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 27/408 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 73/481 variables, 49/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/481 variables, 7/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/487 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/487 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/487 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 194 constraints, problems are : Problem set: 0 solved, 1 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1001ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 17 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 158/158 places, 714/714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-22 20:10:56] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:10:56] [INFO ] Invariant cache hit.
[2026-05-22 20:10:56] [INFO ] Implicit Places using invariants in 261 ms returned []
[2026-05-22 20:10:56] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:10:56] [INFO ] Invariant cache hit.
[2026-05-22 20:10:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:10:56] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 798 ms to find 0 implicit places.
[2026-05-22 20:10:56] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 834 ms. Remains : 158/158 places, 714/714 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 158 vertex of which 56 / 158 are part of one of the 7 SCC in 0 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 227
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 74 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 74 transition count 215
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 62 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 56 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 56 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 50 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 50 transition count 167
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 50 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 43 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 43 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 36 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 36 transition count 71
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 290 place count 24 transition count 65
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 330 place count 24 transition count 25
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 24 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 332 place count 23 transition count 24
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 339 place count 23 transition count 24
Applied a total of 339 rules in 13 ms. Remains 23 /158 variables (removed 135) and now considering 24/714 (removed 690) 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-2429718248029755929.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7914609126653811399.kers'
[2026-05-22 20:10:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2429718248029755929.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7914609126653811399.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 23 cols 123 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-22 20:10:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7914609126653811399.kers
Total runtime 0 ms.
[2026-05-22 20:10:57] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:10:57] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-22 20:10:57] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:10:57] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:10:57] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 96 ms.
RANDOM walk for 40000 steps (463 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298068 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298068 steps, saw 56175 distinct states, run finished after 3005 ms. (steps per millisecond=99 ) properties seen :0
[2026-05-22 20:11:00] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16723844360729690748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9067543831385735692.kers'
[2026-05-22 20:11:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16723844360729690748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9067543831385735692.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 339 rows 155 cols 1134 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-22 20:11:00] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9067543831385735692.kers
Total runtime 2 ms.
[2026-05-22 20:11:00] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 213/235 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 14/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 39/274 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/315 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/315 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 160/475 variables, 100/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/475 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/475 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/505 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/507 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 232 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 213/235 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 39/274 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/315 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/315 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/475 variables, 100/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/475 variables, 2/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/475 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/475 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 30/505 variables, 17/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/507 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 729 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 988ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 719
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 163 transition count 719
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 158 transition count 714
Applied a total of 20 rules in 25 ms. Remains 158 /168 variables (removed 10) and now considering 714/724 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 158/168 places, 714/724 transitions.
RANDOM walk for 40000 steps (466 resets) in 207 ms. (192 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (49 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 327053 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 327053 steps, saw 60782 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
[2026-05-22 20:11:04] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7635405738166553195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13597660398917580349.kers'
[2026-05-22 20:11:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7635405738166553195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13597660398917580349.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 329 rows 145 cols 1094 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-22 20:11:04] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13597660398917580349.kers
Total runtime 2 ms.
[2026-05-22 20:11:04] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/175 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 41/216 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 169/385 variables, 71/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/412 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/412 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 69/481 variables, 48/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/481 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/481 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/487 variables, 6/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 243 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 153/175 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 14/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 41/216 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 169/385 variables, 71/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 27/412 variables, 3/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/412 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 69/481 variables, 48/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/481 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 6/487 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 955 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1226ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 158/158 places, 714/714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 17 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-22 20:11:05] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:11:05] [INFO ] Invariant cache hit.
[2026-05-22 20:11:05] [INFO ] Implicit Places using invariants in 253 ms returned []
[2026-05-22 20:11:05] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:11:05] [INFO ] Invariant cache hit.
[2026-05-22 20:11:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:11:06] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2026-05-22 20:11:06] [INFO ] Redundant transitions in 12 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 907 ms. Remains : 158/158 places, 714/714 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 158 vertex of which 56 / 158 are part of one of the 7 SCC in 0 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 227
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 74 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 74 transition count 215
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 62 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 56 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 56 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 50 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 50 transition count 167
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 50 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 43 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 43 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 36 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 36 transition count 71
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 36 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 289 place count 25 transition count 65
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 321 place count 25 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 24 transition count 32
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 330 place count 24 transition count 32
Applied a total of 330 rules in 9 ms. Remains 24 /158 variables (removed 134) and now considering 32/714 (removed 682) 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-15565237586691047021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15699064031862791126.kers'
[2026-05-22 20:11:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15565237586691047021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15699064031862791126.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 24 cols 155 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-22 20:11:06] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15699064031862791126.kers
Total runtime 0 ms.
[2026-05-22 20:11:06] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:11:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 20:11:06] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-22 20:11:06] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:11:06] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:11:06] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
RANDOM walk for 40000 steps (468 resets) in 232 ms. (171 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 328927 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 328927 steps, saw 60958 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2026-05-22 20:11:09] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6166183053801296791.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7972435916368378483.kers'
[2026-05-22 20:11:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6166183053801296791.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7972435916368378483.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 339 rows 155 cols 1134 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-22 20:11:09] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7972435916368378483.kers
Total runtime 2 ms.
[2026-05-22 20:11:09] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/314 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/340 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/360 variables, 7/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 108/468 variables, 71/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/468 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 37/505 variables, 21/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/505 variables, 7/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/505 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/507 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/507 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 255/314 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/340 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/360 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/468 variables, 71/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 37/505 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/507 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1062ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 719
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 163 transition count 719
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 158 transition count 714
Applied a total of 20 rules in 24 ms. Remains 158 /168 variables (removed 10) and now considering 714/724 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 158/168 places, 714/724 transitions.
RANDOM walk for 40000 steps (458 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (50 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 333586 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 333586 steps, saw 61668 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2026-05-22 20:11:13] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17764194980025598295.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12355373698655150808.kers'
[2026-05-22 20:11:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17764194980025598295.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12355373698655150808.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 329 rows 145 cols 1094 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-22 20:11:13] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12355373698655150808.kers
Total runtime 3 ms.
[2026-05-22 20:11:13] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/254 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/274 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/385 variables, 45/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 18/403 variables, 2/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/403 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 76/479 variables, 45/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 7/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 8/487 variables, 8/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/487 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/487 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 195/254 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/274 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 111/385 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/385 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 18/403 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/479 variables, 45/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/479 variables, 7/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/479 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 8/487 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/487 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/487 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 197 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1112 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1773ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 30 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 158/158 places, 714/714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 30 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-22 20:11:15] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:11:15] [INFO ] Invariant cache hit.
[2026-05-22 20:11:16] [INFO ] Implicit Places using invariants in 382 ms returned []
[2026-05-22 20:11:16] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:11:16] [INFO ] Invariant cache hit.
[2026-05-22 20:11:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:11:16] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2026-05-22 20:11:16] [INFO ] Redundant transitions in 20 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1163 ms. Remains : 158/158 places, 714/714 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 158 vertex of which 56 / 158 are part of one of the 7 SCC in 0 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 227
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 74 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 74 transition count 215
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 62 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 56 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 56 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 50 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 50 transition count 167
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 50 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 43 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 43 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 36 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 36 transition count 71
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 36 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 289 place count 25 transition count 65
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 321 place count 25 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 24 transition count 32
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 330 place count 24 transition count 32
Applied a total of 330 rules in 24 ms. Remains 24 /158 variables (removed 134) and now considering 32/714 (removed 682) 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-1216259834695909363.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14096368023686972622.kers'
[2026-05-22 20:11:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1216259834695909363.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14096368023686972622.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 24 cols 155 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-22 20:11:16] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14096368023686972622.kers
Total runtime 1 ms.
[2026-05-22 20:11:16] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:11:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-22 20:11:16] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 4 ms returned sat
[2026-05-22 20:11:16] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:11:16] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:11:16] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 145 ms.
RANDOM walk for 40000 steps (461 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 323715 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 1
Probabilistic random walk after 323715 steps, saw 60203 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2026-05-22 20:11:20] [INFO ] Flow matrix only has 339 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1461620016791084570.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7183682854528304113.kers'
[2026-05-22 20:11:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1461620016791084570.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7183682854528304113.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 339 rows 155 cols 1134 entries
Finished phase 1 with 143 SingleSign rule and 1 generalized
[2026-05-22 20:11:20] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7183682854528304113.kers
Total runtime 2 ms.
[2026-05-22 20:11:20] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/314 variables, 55/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 14/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/340 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/360 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 108/468 variables, 71/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/468 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 37/505 variables, 21/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/505 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/507 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/507 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/507 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 507/507 variables, and 203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 255/314 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/340 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/340 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/340 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/340 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/360 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 108/468 variables, 71/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/468 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/468 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/468 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 37/505 variables, 21/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/505 variables, 7/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/505 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 2/507 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/507 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 507/507 variables, and 204 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 168/168 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 724/724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 719
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 163 transition count 719
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 158 transition count 714
Applied a total of 20 rules in 25 ms. Remains 158 /168 variables (removed 10) and now considering 714/724 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 158/168 places, 714/724 transitions.
RANDOM walk for 40000 steps (467 resets) in 201 ms. (198 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (48 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 350794 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 350794 steps, saw 64220 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2026-05-22 20:11:24] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11122229724529679676.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18200797192580364073.kers'
[2026-05-22 20:11:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11122229724529679676.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18200797192580364073.kers]
Culling duplicate invariants (modulo rational): removing 13 columns.
Culled 13 columns in 0 ms.
// Phase 1: matrix 329 rows 145 cols 1094 entries
Finished phase 1 with 133 SingleSign rule and 1 generalized
[2026-05-22 20:11:24] [INFO ] Computed 24 invariants in 1 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18200797192580364073.kers
Total runtime 2 ms.
[2026-05-22 20:11:24] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/254 variables, 45/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/254 variables, 14/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 20/274 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 111/385 variables, 45/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 2/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 18/403 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 76/479 variables, 45/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 7/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 8/487 variables, 8/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/487 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 191 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 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) 14/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/59 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 195/254 variables, 45/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/254 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/274 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 111/385 variables, 45/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/385 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 18/403 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/479 variables, 45/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/479 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 8/487 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/487 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 195 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 158/158 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1434ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 16 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 158/158 places, 714/714 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 714/714 transitions.
Applied a total of 0 rules in 17 ms. Remains 158 /158 variables (removed 0) and now considering 714/714 (removed 0) transitions.
[2026-05-22 20:11:25] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:11:25] [INFO ] Invariant cache hit.
[2026-05-22 20:11:26] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-22 20:11:26] [INFO ] Flow matrix only has 329 transitions (discarded 385 similar events)
[2026-05-22 20:11:26] [INFO ] Invariant cache hit.
[2026-05-22 20:11:26] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-22 20:11:26] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 942 ms to find 0 implicit places.
[2026-05-22 20:11:26] [INFO ] Redundant transitions in 11 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 977 ms. Remains : 158/158 places, 714/714 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 158 vertex of which 56 / 158 are part of one of the 7 SCC in 0 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 96 transition count 227
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 74 transition count 227
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 74 transition count 215
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 62 transition count 215
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 56 transition count 209
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 56 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 50 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 50 transition count 167
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 50 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 43 transition count 106
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 43 transition count 94
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 36 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 36 transition count 71
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 273 place count 36 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 274 place count 35 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 15 rules applied. Total rules applied 289 place count 25 transition count 65
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 321 place count 25 transition count 33
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 322 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 323 place count 24 transition count 32
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 330 place count 24 transition count 32
Applied a total of 330 rules in 9 ms. Remains 24 /158 variables (removed 134) and now considering 32/714 (removed 682) 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-10808224105207924718.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5809076908845604036.kers'
[2026-05-22 20:11:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10808224105207924718.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5809076908845604036.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 32 rows 24 cols 155 entries
Finished phase 1 with 14 SingleSign rule and 1 generalized
[2026-05-22 20:11:26] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5809076908845604036.kers
Total runtime 1 ms.
[2026-05-22 20:11:26] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 20:11:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2026-05-22 20:11:26] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 2 ms returned sat
[2026-05-22 20:11:26] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 20:11:26] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 20:11:26] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 90 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 160 edges and 168 vertex of which 56 / 168 are part of one of the 7 SCC in 0 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 385 transitions
Reduce isomorphic transitions removed 465 transitions.
Ensure Unique test removed 13 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 106 transition count 237
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 58 place count 84 transition count 237
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 58 place count 84 transition count 225
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 72 transition count 225
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 66 transition count 219
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 66 transition count 219
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 100 place count 60 transition count 177
Iterating global reduction 2 with 6 rules applied. Total rules applied 106 place count 60 transition count 177
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 2 with 54 rules applied. Total rules applied 160 place count 60 transition count 123
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 174 place count 53 transition count 116
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 186 place count 53 transition count 104
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 200 place count 46 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 72 transitions
Redundant transition composition rules discarded 72 transitions
Iterating global reduction 4 with 72 rules applied. Total rules applied 272 place count 46 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 275 place count 44 transition count 80
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 282 place count 44 transition count 80
Applied a total of 282 rules in 14 ms. Remains 44 /168 variables (removed 124) and now considering 80/724 (removed 644) transitions.
Running SMT prover for 6 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17209661805744292480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18265286651964870508.kers'
[2026-05-22 20:11:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17209661805744292480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18265286651964870508.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 44 cols 335 entries
Finished phase 1 with 30 SingleSign rule and 1 generalized
[2026-05-22 20:11:26] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18265286651964870508.kers
Total runtime 0 ms.
[2026-05-22 20:11:27] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2026-05-22 20:11:27] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2026-05-22 20:11:27] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2026-05-22 20:11:27] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2026-05-22 20:11:27] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2026-05-22 20:11:27] [INFO ] After 200ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2026-05-22 20:11:27] [INFO ] Flatten gal took : 3 ms
[2026-05-22 20:11:27] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:11:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13285305356384626227.gal : 1 ms
[2026-05-22 20:11:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15218626351330566267.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/ReachabilityCardinality13285305356384626227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15218626351330566267.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/ReachabilityCardinality15218626351330566267.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :9 after 45
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :45 after 167
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :167 after 516
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :516 after 1410
Invariant property smplace_1502 does not hold.
Invariant property smplace_1270 does not hold.
Invariant property smplace_1038 does not hold.
Invariant property smplace_806 does not hold.
Invariant property smplace_574 does not hold.
Invariant property smplace_342 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12770,0.034191,5760,2,331,17,2393,6,0,251,1196,0
Total reachable state count : 12770

Verifying 6 reachability properties.
Invariant property smplace_342 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_342,1,0.034561,5760,2,45,17,2393,7,0,254,1196,0
Invariant property smplace_574 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_574,4,0.034829,5760,2,48,17,2393,8,0,256,1196,0
Invariant property smplace_806 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_806,16,0.035038,5760,2,51,17,2393,9,0,258,1196,0
Invariant property smplace_1038 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1038,64,0.035254,5760,2,55,17,2393,10,0,260,1196,0
Invariant property smplace_1270 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1270,256,0.035474,5760,2,58,17,2393,11,0,262,1196,0
Invariant property smplace_1502 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1502,1024,0.035692,5760,2,61,17,2393,12,0,264,1196,0
Over-approximation ignoring read arcs solved 0 properties in 524 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 20:11:27] [INFO ] Flatten gal took : 36 ms
[2026-05-22 20:11:27] [INFO ] Flatten gal took : 38 ms
[2026-05-22 20:11:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9984419397358122013.gal : 4 ms
[2026-05-22 20:11:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability16887971475985195385.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/ReachabilityFireability9984419397358122013.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability16887971475985195385.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/ReachabilityFireability16887971475985195385.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :6 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 16
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :16 after 25
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :25 after 134
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :134 after 760
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :760 after 485374
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :485374 after 511792
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :511792 after 4.69776e+06
Invariant property smplace_1502 does not hold.
Invariant property smplace_1270 does not hold.
Invariant property smplace_1038 does not hold.
Invariant property smplace_806 does not hold.
Invariant property smplace_574 does not hold.
Invariant property smplace_342 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.15114e+09,1.44448,35248,2,7182,17,120025,6,0,1378,96316,0
Total reachable state count : 2151142640

Verifying 6 reachability properties.
Invariant property smplace_342 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_342,1,1.44603,35248,2,169,17,120025,7,0,1381,96316,0
Invariant property smplace_574 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_574,1,1.44673,35248,2,169,17,120025,8,0,1383,96316,0
Invariant property smplace_806 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_806,1,1.44704,35248,2,169,17,120025,9,0,1385,96316,0
Invariant property smplace_1038 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1038,1,1.44735,35248,2,169,17,120025,10,0,1387,96316,0
Invariant property smplace_1270 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1270,2,1.44779,35248,2,182,17,120025,11,0,1389,96316,0
Invariant property smplace_1502 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
smplace\_1502,512,1.44847,35248,2,1169,17,120025,12,0,1391,96316,0
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 1526 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
Total runtime 838937 ms.

BK_STOP 1779480689080

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="CloudDeployment-PT-7b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 CloudDeployment-PT-7b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r056-smll-177946903000328"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7b.tgz
mv CloudDeployment-PT-7b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;