Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r034-tall-177946841900397.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 BugTracking-PT-q8m004, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946841900397
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.0K Mar 5 17:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 5 17:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 5 17:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 5 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 5 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-00
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-01
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-02
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-03
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-04
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-05
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-06
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-07
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-08
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-09
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-10
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-11
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-12
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-13
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-14
FORMULA_NAME BugTracking-PT-q8m004-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779596649836

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 04:24:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 04:24:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 04:24:11] [INFO ] Load time of PNML (sax parser for PT used): 840 ms
[2026-05-24 04:24:11] [INFO ] Transformed 754 places.
[2026-05-24 04:24:12] [INFO ] Transformed 27370 transitions.
[2026-05-24 04:24:12] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1016 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 474 places in 123 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15147951506415113607.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6416744054941244617.kers'
[2026-05-24 04:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15147951506415113607.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6416744054941244617.kers]
Normalized transition count is 3729 out of 3904 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3729 rows 280 cols 17780 entries
Finished phase 1 with 270 SingleSign rule and 0 generalized
[2026-05-24 04:24:12] [INFO ] Computed 10 invariants in 16 ms
Computed 10 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-6416744054941244617.kers
Total runtime 20 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, 1, +inf, 1, 1, +inf]
RANDOM walk for 10001 steps (97 resets) in 129 ms. (76 steps per ms)
FORMULA BugTracking-PT-q8m004-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BugTracking-PT-q8m004-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60002 steps (156 resets) in 203 ms. (294 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-24 04:24:12] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8160766179346191622.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13180664416147369609.kers'
[2026-05-24 04:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8160766179346191622.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13180664416147369609.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 3729 rows 280 cols 17780 entries
Finished phase 1 with 270 SingleSign rule and 0 generalized
[2026-05-24 04:24:12] [INFO ] Computed 10 invariants in 15 ms
Computed 10 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13180664416147369609.kers
Total runtime 23 ms.
[2026-05-24 04:24:13] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-24 04:24:13] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2026-05-24 04:24:13] [INFO ] State equation strengthened by 303 read => feed constraints.
[2026-05-24 04:24:13] [INFO ] [Real]Added 303 Read/Feed constraints in 99 ms returned sat
[2026-05-24 04:24:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:24:16] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 04:24:16] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2026-05-24 04:24:16] [INFO ] [Real]Added 303 Read/Feed constraints in 79 ms returned sat
[2026-05-24 04:24:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:24:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:17] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2026-05-24 04:24:17] [INFO ] [Nat]Added 303 Read/Feed constraints in 179 ms returned sat
[2026-05-24 04:24:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 549 ms
[2026-05-24 04:24:18] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 347 ms.
[2026-05-24 04:24:19] [INFO ] Added : 4 causal constraints over 1 iterations in 759 ms. Result :sat
Minimization took 1012 ms.
[2026-05-24 04:24:20] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:20] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2026-05-24 04:24:20] [INFO ] [Real]Added 303 Read/Feed constraints in 79 ms returned sat
[2026-05-24 04:24:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:24:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:21] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2026-05-24 04:24:21] [INFO ] [Nat]Added 303 Read/Feed constraints in 80 ms returned sat
[2026-05-24 04:24:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2026-05-24 04:24:22] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 403 ms.
[2026-05-24 04:24:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 698 ms
[2026-05-24 04:24:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-24 04:24:26] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:26] [INFO ] [Real]Absence check using state equation in 600 ms returned sat
[2026-05-24 04:24:26] [INFO ] [Real]Added 303 Read/Feed constraints in 77 ms returned sat
[2026-05-24 04:24:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:24:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:27] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2026-05-24 04:24:27] [INFO ] [Nat]Added 303 Read/Feed constraints in 230 ms returned sat
[2026-05-24 04:24:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2388 ms
[2026-05-24 04:24:30] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 243 ms.
[2026-05-24 04:24:31] [INFO ] Added : 13 causal constraints over 4 iterations in 924 ms. Result :sat
Minimization took 829 ms.
[2026-05-24 04:24:32] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:32] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2026-05-24 04:24:32] [INFO ] [Real]Added 303 Read/Feed constraints in 140 ms returned sat
[2026-05-24 04:24:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:24:32] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:33] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2026-05-24 04:24:33] [INFO ] [Nat]Added 303 Read/Feed constraints in 199 ms returned sat
[2026-05-24 04:24:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 709 ms
[2026-05-24 04:24:34] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 226 ms.
[2026-05-24 04:24:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 677 ms
[2026-05-24 04:24:35] [INFO ] Added : 9 causal constraints over 2 iterations in 1471 ms. Result :sat
Minimization took 1011 ms.
[2026-05-24 04:24:36] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2026-05-24 04:24:37] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2026-05-24 04:24:37] [INFO ] [Real]Added 303 Read/Feed constraints in 83 ms returned sat
[2026-05-24 04:24:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:24:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-24 04:24:38] [INFO ] [Nat]Absence check using state equation in 552 ms returned sat
[2026-05-24 04:24:38] [INFO ] [Nat]Added 303 Read/Feed constraints in 211 ms returned sat
[2026-05-24 04:24:38] [INFO ] Computed and/alt/rep : 471/1801/471 causal constraints (skipped 3256 transitions) in 204 ms.
[2026-05-24 04:24:39] [INFO ] Added : 5 causal constraints over 1 iterations in 538 ms. Result :sat
Minimization took 1011 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Graph (complete) has 4653 edges and 280 vertex of which 278 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 19 place count 269 transition count 3871
Applied a total of 19 rules in 369 ms. Remains 269 /280 variables (removed 11) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 269/280 places, 3871/3904 transitions.
[2026-05-24 04:24:40] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
findPositiveTsemiflow completed in 562 ms - Found solution {2=1, 44=1, 3014=1, 3635=1} and attempted to minimize in 0 ms success -> {2=1, 3014=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5984711371959984299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10487159669133062194.kers'
[2026-05-24 04:24:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5984711371959984299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10487159669133062194.kers]
Normalized transition count is 3699 out of 3871 initially.
Culled 0 columns in 2 ms.
// Phase 1: matrix 3699 rows 269 cols 17677 entries
Finished phase 1 with 261 SingleSign rule and 0 generalized
[2026-05-24 04:24:51] [INFO ] Computed 8 invariants in 16 ms
Computed 8 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-10487159669133062194.kers
Total runtime 26 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
RANDOM walk for 1000000 steps (2 resets) in 6367 ms. (157 steps per ms)
BEST_FIRST walk for 6000006 steps (14 resets) in 12337 ms. (486 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
[2026-05-24 04:25:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18073867275738676006.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12039849439823210698.kers'
[2026-05-24 04:25:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18073867275738676006.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12039849439823210698.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 3699 rows 269 cols 17677 entries
Finished phase 1 with 261 SingleSign rule and 0 generalized
[2026-05-24 04:25:10] [INFO ] Computed 8 invariants in 14 ms
Computed 8 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-12039849439823210698.kers
Total runtime 20 ms.
[2026-05-24 04:25:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 04:25:10] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2026-05-24 04:25:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-24 04:25:11] [INFO ] [Real]Added 283 Read/Feed constraints in 78 ms returned sat
[2026-05-24 04:25:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:25:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:11] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2026-05-24 04:25:11] [INFO ] [Nat]Added 283 Read/Feed constraints in 209 ms returned sat
[2026-05-24 04:25:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 575 ms
[2026-05-24 04:25:12] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 249 ms.
[2026-05-24 04:25:13] [INFO ] Added : 3 causal constraints over 1 iterations in 593 ms. Result :sat
Minimization took 3424 ms.
[2026-05-24 04:25:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:17] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2026-05-24 04:25:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:25:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:17] [INFO ] [Nat]Absence check using state equation in 561 ms returned sat
[2026-05-24 04:25:18] [INFO ] [Nat]Added 283 Read/Feed constraints in 102 ms returned sat
[2026-05-24 04:25:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1694 ms
[2026-05-24 04:25:20] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 261 ms.
[2026-05-24 04:25:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 5341 ms
[2026-05-24 04:25:26] [INFO ] Added : 5 causal constraints over 3 iterations in 6420 ms. Result :sat
Minimization took 4342 ms.
[2026-05-24 04:25:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:31] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2026-05-24 04:25:31] [INFO ] [Real]Added 283 Read/Feed constraints in 68 ms returned sat
[2026-05-24 04:25:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:25:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:31] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2026-05-24 04:25:32] [INFO ] [Nat]Added 283 Read/Feed constraints in 91 ms returned sat
[2026-05-24 04:25:32] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 230 ms.
[2026-05-24 04:25:32] [INFO ] Added : 1 causal constraints over 1 iterations in 538 ms. Result :sat
Minimization took 3835 ms.
[2026-05-24 04:25:36] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 04:25:37] [INFO ] [Real]Absence check using state equation in 585 ms returned sat
[2026-05-24 04:25:37] [INFO ] [Real]Added 283 Read/Feed constraints in 67 ms returned sat
[2026-05-24 04:25:37] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:25:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 04:25:38] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2026-05-24 04:25:38] [INFO ] [Nat]Added 283 Read/Feed constraints in 280 ms returned sat
[2026-05-24 04:25:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2902 ms
[2026-05-24 04:25:41] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 227 ms.
[2026-05-24 04:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 580 ms
[2026-05-24 04:25:42] [INFO ] Added : 8 causal constraints over 3 iterations in 1524 ms. Result :sat
Minimization took 4392 ms.
[2026-05-24 04:25:47] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:47] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2026-05-24 04:25:47] [INFO ] [Real]Added 283 Read/Feed constraints in 82 ms returned sat
[2026-05-24 04:25:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:25:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:48] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2026-05-24 04:25:48] [INFO ] [Nat]Added 283 Read/Feed constraints in 210 ms returned sat
[2026-05-24 04:25:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1194 ms
[2026-05-24 04:25:50] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 214 ms.
[2026-05-24 04:25:50] [INFO ] Added : 5 causal constraints over 1 iterations in 576 ms. Result :sat
Minimization took 3335 ms.
[2026-05-24 04:25:54] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-24 04:25:54] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2026-05-24 04:25:54] [INFO ] [Real]Added 283 Read/Feed constraints in 54 ms returned sat
[2026-05-24 04:25:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:25:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:25:55] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2026-05-24 04:25:55] [INFO ] [Nat]Added 283 Read/Feed constraints in 190 ms returned sat
[2026-05-24 04:25:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 998 ms
[2026-05-24 04:25:56] [INFO ] Computed and/alt/rep : 458/1718/458 causal constraints (skipped 3240 transitions) in 213 ms.
[2026-05-24 04:25:57] [INFO ] Added : 3 causal constraints over 1 iterations in 546 ms. Result :sat
Minimization took 3358 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 3, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, 1, +inf]
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 87 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2026-05-24 04:26:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-24 04:26:01] [INFO ] Invariant cache hit.
[2026-05-24 04:26:01] [INFO ] Implicit Places using invariants in 427 ms returned []
[2026-05-24 04:26:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-24 04:26:01] [INFO ] Invariant cache hit.
[2026-05-24 04:26:02] [INFO ] State equation strengthened by 283 read => feed constraints.
[2026-05-24 04:26:04] [INFO ] Implicit Places using invariants and state equation in 2919 ms returned []
Implicit Place search using SMT with State Equation took 3351 ms to find 0 implicit places.
[2026-05-24 04:26:04] [INFO ] Redundant transitions in 269 ms returned []
Running 3870 sub problems to find dead transitions.
[2026-05-24 04:26:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2026-05-24 04:26:04] [INFO ] Invariant cache hit.
[2026-05-24 04:26:04] [INFO ] State equation strengthened by 283 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 269/3968 variables, and 8 constraints, problems are : Problem set: 0 solved, 3870 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/269 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3870/598 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3870 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3870 unsolved
Problem TDEAD1546 is UNSAT
Problem TDEAD1547 is UNSAT
Problem TDEAD1548 is UNSAT
Problem TDEAD1549 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1551 is UNSAT
Problem TDEAD1552 is UNSAT
Problem TDEAD1553 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1557 is UNSAT
Problem TDEAD1558 is UNSAT
Problem TDEAD1559 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1561 is UNSAT
Problem TDEAD1562 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1568 is UNSAT
Problem TDEAD1569 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1571 is UNSAT
Problem TDEAD1572 is UNSAT
Problem TDEAD1573 is UNSAT
Problem TDEAD1574 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1579 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1581 is UNSAT
Problem TDEAD1582 is UNSAT
Problem TDEAD1586 is UNSAT
Problem TDEAD1587 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1591 is UNSAT
Problem TDEAD1592 is UNSAT
Problem TDEAD1593 is UNSAT
Problem TDEAD1594 is UNSAT
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1624 is UNSAT
Problem TDEAD1625 is UNSAT
Problem TDEAD1626 is UNSAT
Problem TDEAD1627 is UNSAT
Problem TDEAD1628 is UNSAT
Problem TDEAD1629 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1634 is UNSAT
Problem TDEAD1635 is UNSAT
Problem TDEAD1636 is UNSAT
Problem TDEAD1637 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1639 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1641 is UNSAT
Problem TDEAD1642 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1646 is UNSAT
Problem TDEAD1647 is UNSAT
Problem TDEAD1648 is UNSAT
Problem TDEAD1649 is UNSAT
Problem TDEAD1650 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1652 is UNSAT
Problem TDEAD1653 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1677 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1679 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1696 is UNSAT
Problem TDEAD1697 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1712 is UNSAT
Problem TDEAD1713 is UNSAT
Problem TDEAD1714 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1803 is UNSAT
Problem TDEAD1804 is UNSAT
Problem TDEAD1805 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1807 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1809 is UNSAT
Problem TDEAD1810 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1813 is UNSAT
Problem TDEAD1814 is UNSAT
Problem TDEAD1815 is UNSAT
Problem TDEAD1816 is UNSAT
Problem TDEAD1817 is UNSAT
Problem TDEAD1818 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1820 is UNSAT
Problem TDEAD1821 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1823 is UNSAT
Problem TDEAD1824 is UNSAT
Problem TDEAD1825 is UNSAT
Problem TDEAD1826 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1828 is UNSAT
Problem TDEAD1829 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1831 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1834 is UNSAT
Problem TDEAD1835 is UNSAT
Problem TDEAD1836 is UNSAT
Problem TDEAD1837 is UNSAT
Problem TDEAD1838 is UNSAT
Problem TDEAD1839 is UNSAT
Problem TDEAD1840 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1843 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1846 is UNSAT
Problem TDEAD1847 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1849 is UNSAT
Problem TDEAD1850 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
Problem TDEAD2126 is UNSAT
Problem TDEAD2127 is UNSAT
Problem TDEAD2132 is UNSAT
Problem TDEAD2133 is UNSAT
Problem TDEAD2134 is UNSAT
Problem TDEAD2135 is UNSAT
Problem TDEAD2136 is UNSAT
Problem TDEAD2137 is UNSAT
Problem TDEAD2138 is UNSAT
Problem TDEAD2139 is UNSAT
Problem TDEAD2140 is UNSAT
Problem TDEAD2141 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2143 is UNSAT
Problem TDEAD2144 is UNSAT
Problem TDEAD2145 is UNSAT
Problem TDEAD2146 is UNSAT
Problem TDEAD2147 is UNSAT
Problem TDEAD2151 is UNSAT
Problem TDEAD2152 is UNSAT
Problem TDEAD2153 is UNSAT
Problem TDEAD2154 is UNSAT
Problem TDEAD2155 is UNSAT
Problem TDEAD2156 is UNSAT
Problem TDEAD2157 is UNSAT
Problem TDEAD2158 is UNSAT
Problem TDEAD2159 is UNSAT
Problem TDEAD2160 is UNSAT
Problem TDEAD2161 is UNSAT
Problem TDEAD2162 is UNSAT
Problem TDEAD2167 is UNSAT
Problem TDEAD2168 is UNSAT
Problem TDEAD2169 is UNSAT
Problem TDEAD2170 is UNSAT
Problem TDEAD2171 is UNSAT
Problem TDEAD2172 is UNSAT
Problem TDEAD2173 is UNSAT
Problem TDEAD2174 is UNSAT
Problem TDEAD2175 is UNSAT
Problem TDEAD2176 is UNSAT
Problem TDEAD2177 is UNSAT
Problem TDEAD2178 is UNSAT
Problem TDEAD2179 is UNSAT
Problem TDEAD2180 is UNSAT
Problem TDEAD2181 is UNSAT
Problem TDEAD2182 is UNSAT
Problem TDEAD2186 is UNSAT
Problem TDEAD2187 is UNSAT
Problem TDEAD2188 is UNSAT
Problem TDEAD2189 is UNSAT
Problem TDEAD2190 is UNSAT
Problem TDEAD2191 is UNSAT
Problem TDEAD2192 is UNSAT
Problem TDEAD2193 is UNSAT
Problem TDEAD2194 is UNSAT
Problem TDEAD2195 is UNSAT
Problem TDEAD2196 is UNSAT
Problem TDEAD2197 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2203 is UNSAT
Problem TDEAD2204 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2206 is UNSAT
Problem TDEAD2207 is UNSAT
Problem TDEAD2208 is UNSAT
Problem TDEAD2209 is UNSAT
Problem TDEAD2210 is UNSAT
Problem TDEAD2211 is UNSAT
Problem TDEAD2212 is UNSAT
Problem TDEAD2213 is UNSAT
Problem TDEAD2214 is UNSAT
Problem TDEAD2215 is UNSAT
Problem TDEAD2216 is UNSAT
Problem TDEAD2217 is UNSAT
Problem TDEAD2221 is UNSAT
Problem TDEAD2222 is UNSAT
Problem TDEAD2223 is UNSAT
Problem TDEAD2224 is UNSAT
Problem TDEAD2225 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2227 is UNSAT
Problem TDEAD2228 is UNSAT
Problem TDEAD2229 is UNSAT
Problem TDEAD2230 is UNSAT
Problem TDEAD2231 is UNSAT
Problem TDEAD2232 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
Problem TDEAD2401 is UNSAT
Problem TDEAD2402 is UNSAT
Problem TDEAD2403 is UNSAT
Problem TDEAD2404 is UNSAT
Problem TDEAD2405 is UNSAT
Problem TDEAD2406 is UNSAT
Problem TDEAD2407 is UNSAT
Problem TDEAD2408 is UNSAT
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2417 is UNSAT
Problem TDEAD2418 is UNSAT
Problem TDEAD2419 is UNSAT
Problem TDEAD2420 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2443 is UNSAT
Problem TDEAD2444 is UNSAT
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2459 is UNSAT
Problem TDEAD2460 is UNSAT
Problem TDEAD2461 is UNSAT
Problem TDEAD2462 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2467 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2471 is UNSAT
Problem TDEAD2472 is UNSAT
Problem TDEAD2473 is UNSAT
Problem TDEAD2474 is UNSAT
Problem TDEAD2475 is UNSAT
Problem TDEAD2476 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2482 is UNSAT
Problem TDEAD2483 is UNSAT
Problem TDEAD2484 is UNSAT
Problem TDEAD2485 is UNSAT
Problem TDEAD2486 is UNSAT
Problem TDEAD2487 is UNSAT
Problem TDEAD2488 is UNSAT
Problem TDEAD2489 is UNSAT
Problem TDEAD2490 is UNSAT
Problem TDEAD2491 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
Problem TDEAD2495 is UNSAT
Problem TDEAD2496 is UNSAT
Problem TDEAD2497 is UNSAT
Problem TDEAD2498 is UNSAT
Problem TDEAD2499 is UNSAT
Problem TDEAD2500 is UNSAT
Problem TDEAD2501 is UNSAT
Problem TDEAD2502 is UNSAT
Problem TDEAD2503 is UNSAT
Problem TDEAD2504 is UNSAT
Problem TDEAD2505 is UNSAT
Problem TDEAD2506 is UNSAT
Problem TDEAD2507 is UNSAT
Problem TDEAD2508 is UNSAT
Problem TDEAD2509 is UNSAT
Problem TDEAD2510 is UNSAT
Problem TDEAD2511 is UNSAT
Problem TDEAD2512 is UNSAT
Problem TDEAD2513 is UNSAT
Problem TDEAD2514 is UNSAT
Problem TDEAD2515 is UNSAT
Problem TDEAD2516 is UNSAT
Problem TDEAD2517 is UNSAT
Problem TDEAD2518 is UNSAT
Problem TDEAD2519 is UNSAT
Problem TDEAD2520 is UNSAT
Problem TDEAD2521 is UNSAT
Problem TDEAD2522 is UNSAT
Problem TDEAD2523 is UNSAT
Problem TDEAD2524 is UNSAT
Problem TDEAD2525 is UNSAT
Problem TDEAD2526 is UNSAT
Problem TDEAD2527 is UNSAT
Problem TDEAD2528 is UNSAT
Problem TDEAD2529 is UNSAT
Problem TDEAD2530 is UNSAT
Problem TDEAD2531 is UNSAT
Problem TDEAD2532 is UNSAT
Problem TDEAD2533 is UNSAT
Problem TDEAD2534 is UNSAT
Problem TDEAD2535 is UNSAT
Problem TDEAD2536 is UNSAT
Problem TDEAD2537 is UNSAT
Problem TDEAD2538 is UNSAT
Problem TDEAD2539 is UNSAT
Problem TDEAD2540 is UNSAT
Problem TDEAD2541 is UNSAT
Problem TDEAD2542 is UNSAT
Problem TDEAD2543 is UNSAT
Problem TDEAD2544 is UNSAT
Problem TDEAD2545 is UNSAT
Problem TDEAD2546 is UNSAT
Problem TDEAD2547 is UNSAT
Problem TDEAD2548 is UNSAT
Problem TDEAD2549 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2551 is UNSAT
Problem TDEAD2552 is UNSAT
Problem TDEAD2553 is UNSAT
Problem TDEAD2554 is UNSAT
Problem TDEAD2555 is UNSAT
Problem TDEAD2556 is UNSAT
Problem TDEAD2557 is UNSAT
Problem TDEAD2558 is UNSAT
Problem TDEAD2559 is UNSAT
Problem TDEAD2560 is UNSAT
Problem TDEAD2561 is UNSAT
Problem TDEAD2562 is UNSAT
Problem TDEAD2563 is UNSAT
Problem TDEAD2564 is UNSAT
Problem TDEAD2565 is UNSAT
Problem TDEAD2566 is UNSAT
Problem TDEAD2567 is UNSAT
Problem TDEAD2568 is UNSAT
Problem TDEAD2569 is UNSAT
Problem TDEAD2570 is UNSAT
Problem TDEAD2571 is UNSAT
Problem TDEAD2572 is UNSAT
Problem TDEAD2573 is UNSAT
Problem TDEAD2574 is UNSAT
Problem TDEAD2575 is UNSAT
Problem TDEAD2576 is UNSAT
Problem TDEAD2577 is UNSAT
Problem TDEAD2578 is UNSAT
Problem TDEAD2579 is UNSAT
Problem TDEAD2580 is UNSAT
Problem TDEAD2581 is UNSAT
Problem TDEAD2582 is UNSAT
Problem TDEAD2583 is UNSAT
Problem TDEAD2584 is UNSAT
Problem TDEAD2585 is UNSAT
Problem TDEAD2586 is UNSAT
Problem TDEAD2587 is UNSAT
Problem TDEAD2588 is UNSAT
Problem TDEAD2589 is UNSAT
Problem TDEAD2590 is UNSAT
Problem TDEAD2591 is UNSAT
Problem TDEAD2592 is UNSAT
Problem TDEAD2593 is UNSAT
Problem TDEAD2594 is UNSAT
Problem TDEAD2595 is UNSAT
Problem TDEAD2596 is UNSAT
Problem TDEAD2597 is UNSAT
Problem TDEAD2598 is UNSAT
Problem TDEAD2599 is UNSAT
Problem TDEAD2600 is UNSAT
Problem TDEAD2601 is UNSAT
Problem TDEAD2602 is UNSAT
Problem TDEAD2603 is UNSAT
Problem TDEAD2604 is UNSAT
Problem TDEAD2605 is UNSAT
Problem TDEAD2606 is UNSAT
Problem TDEAD2607 is UNSAT
Problem TDEAD2608 is UNSAT
Problem TDEAD2609 is UNSAT
Problem TDEAD2610 is UNSAT
Problem TDEAD2611 is UNSAT
Problem TDEAD2612 is UNSAT
Problem TDEAD2613 is UNSAT
Problem TDEAD2614 is UNSAT
Problem TDEAD2615 is UNSAT
Problem TDEAD2616 is UNSAT
Problem TDEAD2617 is UNSAT
Problem TDEAD2618 is UNSAT
Problem TDEAD2619 is UNSAT
Problem TDEAD2620 is UNSAT
Problem TDEAD2621 is UNSAT
Problem TDEAD2622 is UNSAT
Problem TDEAD2623 is UNSAT
Problem TDEAD2624 is UNSAT
Problem TDEAD2625 is UNSAT
Problem TDEAD2626 is UNSAT
Problem TDEAD2627 is UNSAT
Problem TDEAD2628 is UNSAT
Problem TDEAD2629 is UNSAT
Problem TDEAD2630 is UNSAT
Problem TDEAD2631 is UNSAT
Problem TDEAD2632 is UNSAT
Problem TDEAD2633 is UNSAT
Problem TDEAD2634 is UNSAT
Problem TDEAD2635 is UNSAT
Problem TDEAD2636 is UNSAT
Problem TDEAD2637 is UNSAT
Problem TDEAD2638 is UNSAT
Problem TDEAD2639 is UNSAT
Problem TDEAD2640 is UNSAT
Problem TDEAD2641 is UNSAT
Problem TDEAD2642 is UNSAT
Problem TDEAD2643 is UNSAT
Problem TDEAD2644 is UNSAT
Problem TDEAD2645 is UNSAT
Problem TDEAD2646 is UNSAT
Problem TDEAD2647 is UNSAT
Problem TDEAD2648 is UNSAT
Problem TDEAD2649 is UNSAT
Problem TDEAD2650 is UNSAT
Problem TDEAD2651 is UNSAT
Problem TDEAD2652 is UNSAT
Problem TDEAD2653 is UNSAT
Problem TDEAD2654 is UNSAT
Problem TDEAD2655 is UNSAT
Problem TDEAD2656 is UNSAT
Problem TDEAD2657 is UNSAT
Problem TDEAD2658 is UNSAT
Problem TDEAD2659 is UNSAT
Problem TDEAD2660 is UNSAT
Problem TDEAD2661 is UNSAT
Problem TDEAD2662 is UNSAT
Problem TDEAD2663 is UNSAT
Problem TDEAD2664 is UNSAT
Problem TDEAD2665 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2667 is UNSAT
Problem TDEAD2668 is UNSAT
Problem TDEAD2669 is UNSAT
Problem TDEAD2670 is UNSAT
Problem TDEAD2671 is UNSAT
Problem TDEAD2672 is UNSAT
Problem TDEAD2673 is UNSAT
Problem TDEAD2674 is UNSAT
Problem TDEAD2675 is UNSAT
Problem TDEAD2676 is UNSAT
Problem TDEAD2677 is UNSAT
Problem TDEAD2678 is UNSAT
Problem TDEAD2679 is UNSAT
Problem TDEAD2680 is UNSAT
Problem TDEAD2933 is UNSAT
Problem TDEAD2934 is UNSAT
Problem TDEAD2935 is UNSAT
Problem TDEAD2936 is UNSAT
Problem TDEAD2937 is UNSAT
Problem TDEAD2938 is UNSAT
Problem TDEAD2939 is UNSAT
Problem TDEAD2940 is UNSAT
Problem TDEAD2941 is UNSAT
Problem TDEAD2942 is UNSAT
Problem TDEAD2943 is UNSAT
Problem TDEAD2944 is UNSAT
Problem TDEAD2945 is UNSAT
Problem TDEAD2946 is UNSAT
Problem TDEAD2947 is UNSAT
Problem TDEAD2948 is UNSAT
Problem TDEAD2949 is UNSAT
Problem TDEAD2950 is UNSAT
Problem TDEAD2951 is UNSAT
Problem TDEAD2952 is UNSAT
Problem TDEAD2953 is UNSAT
Problem TDEAD2954 is UNSAT
Problem TDEAD2955 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD2957 is UNSAT
Problem TDEAD2958 is UNSAT
Problem TDEAD2959 is UNSAT
Problem TDEAD2960 is UNSAT
Problem TDEAD2961 is UNSAT
Problem TDEAD2962 is UNSAT
Problem TDEAD2963 is UNSAT
Problem TDEAD2964 is UNSAT
Problem TDEAD2965 is UNSAT
Problem TDEAD2966 is UNSAT
Problem TDEAD2967 is UNSAT
Problem TDEAD2968 is UNSAT
Problem TDEAD2969 is UNSAT
Problem TDEAD2970 is UNSAT
Problem TDEAD2971 is UNSAT
Problem TDEAD2972 is UNSAT
Problem TDEAD2973 is UNSAT
Problem TDEAD2974 is UNSAT
Problem TDEAD2975 is UNSAT
Problem TDEAD2976 is UNSAT
Problem TDEAD2977 is UNSAT
Problem TDEAD2978 is UNSAT
Problem TDEAD2979 is UNSAT
Problem TDEAD2980 is UNSAT
Problem TDEAD2981 is UNSAT
Problem TDEAD2982 is UNSAT
Problem TDEAD2983 is UNSAT
Problem TDEAD2984 is UNSAT
Problem TDEAD2985 is UNSAT
Problem TDEAD2986 is UNSAT
Problem TDEAD2987 is UNSAT
Problem TDEAD2988 is UNSAT
Problem TDEAD2989 is UNSAT
Problem TDEAD2990 is UNSAT
Problem TDEAD2991 is UNSAT
Problem TDEAD2992 is UNSAT
Problem TDEAD2993 is UNSAT
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3021 is UNSAT
Problem TDEAD3022 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3050 is UNSAT
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
Problem TDEAD3057 is UNSAT
Problem TDEAD3063 is UNSAT
Problem TDEAD3064 is UNSAT
Problem TDEAD3065 is UNSAT
Problem TDEAD3066 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3083 is UNSAT
Problem TDEAD3084 is UNSAT
Problem TDEAD3085 is UNSAT
Problem TDEAD3087 is UNSAT
Problem TDEAD3088 is UNSAT
Problem TDEAD3089 is UNSAT
Problem TDEAD3090 is UNSAT
Problem TDEAD3096 is UNSAT
Problem TDEAD3097 is UNSAT
Problem TDEAD3098 is UNSAT
Problem TDEAD3099 is UNSAT
Problem TDEAD3100 is UNSAT
Problem TDEAD3101 is UNSAT
Problem TDEAD3102 is UNSAT
Problem TDEAD3103 is UNSAT
Problem TDEAD3104 is UNSAT
Problem TDEAD3105 is UNSAT
Problem TDEAD3106 is UNSAT
Problem TDEAD3116 is UNSAT
Problem TDEAD3117 is UNSAT
Problem TDEAD3118 is UNSAT
Problem TDEAD3803 is UNSAT
Problem TDEAD3815 is UNSAT
SMT process timed out in 66410ms, After SMT, problems are : Problem set: 916 solved, 2954 unsolved
Search for dead transitions found 916 dead transitions in 66446ms
Found 916 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 916 transitions
Dead transitions reduction (with SMT) removed 916 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 269/269 places, 2955/3871 transitions.
Reduce places removed 27 places and 823 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 242 transition count 2132
Reduce places removed 21 places and 379 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 48 place count 221 transition count 1753
Reduce places removed 6 places and 92 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 54 place count 215 transition count 1661
Reduce places removed 5 places and 24 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 59 place count 210 transition count 1637
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 77 place count 192 transition count 1592
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 12 places and 186 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 107 place count 180 transition count 1406
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 122 place count 165 transition count 1246
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 137 place count 165 transition count 1246
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 137 rules in 63 ms. Remains 165 /269 variables (removed 104) and now considering 1246/2955 (removed 1709) transitions.
[2026-05-24 04:27:11] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13414156743034897353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9237440761762852770.kers'
[2026-05-24 04:27:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13414156743034897353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9237440761762852770.kers]
Culling trivial invariants: removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1121 rows 162 cols 5206 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-24 04:27:11] [INFO ] Computed 11 invariants in 6 ms
Computed 11 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9237440761762852770.kers
Total runtime 7 ms.
[2026-05-24 04:27:11] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 04:27:11] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
[2026-05-24 04:27:11] [INFO ] Invariant cache hit.
[2026-05-24 04:27:11] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-24 04:27:12] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 936 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 165/269 places, 1246/3871 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71213 ms. Remains : 165/269 places, 1246/3871 transitions.
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m004-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
[2026-05-24 04:27:12] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
findPositiveTsemiflow completed in 160 ms - Found solution {0=1, 910=1} and attempted to minimize in 0 ms success -> {3=1, 910=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12390914822373797730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-694040164700335351.kers'
[2026-05-24 04:27:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12390914822373797730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-694040164700335351.kers]
Normalized transition count is 1121 out of 1246 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 1121 rows 162 cols 5206 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-24 04:27:22] [INFO ] Computed 8 invariants in 9 ms
Computed 8 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-694040164700335351.kers
Total runtime 15 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 2350 ms. (425 steps per ms)
BEST_FIRST walk for 3000003 steps (7 resets) in 2782 ms. (1077 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
[2026-05-24 04:27:27] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14888143108612531344.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15076687680465563776.kers'
[2026-05-24 04:27:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14888143108612531344.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15076687680465563776.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1121 rows 162 cols 5206 entries
Finished phase 1 with 154 SingleSign rule and 0 generalized
[2026-05-24 04:27:27] [INFO ] Computed 8 invariants in 7 ms
Computed 8 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-15076687680465563776.kers
Total runtime 9 ms.
[2026-05-24 04:27:27] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:27:27] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2026-05-24 04:27:27] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-24 04:27:27] [INFO ] [Real]Added 125 Read/Feed constraints in 28 ms returned sat
[2026-05-24 04:27:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:27:28] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:27:28] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2026-05-24 04:27:28] [INFO ] [Nat]Added 125 Read/Feed constraints in 51 ms returned sat
[2026-05-24 04:27:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2026-05-24 04:27:28] [INFO ] Computed and/alt/rep : 408/1667/408 causal constraints (skipped 712 transitions) in 60 ms.
[2026-05-24 04:27:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 555 ms
[2026-05-24 04:27:29] [INFO ] Added : 21 causal constraints over 6 iterations in 1038 ms. Result :sat
Minimization took 461 ms.
[2026-05-24 04:27:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:27:30] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-24 04:27:30] [INFO ] [Real]Added 125 Read/Feed constraints in 19 ms returned sat
[2026-05-24 04:27:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:27:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-24 04:27:30] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2026-05-24 04:27:30] [INFO ] [Nat]Added 125 Read/Feed constraints in 35 ms returned sat
[2026-05-24 04:27:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2026-05-24 04:27:30] [INFO ] Computed and/alt/rep : 408/1667/408 causal constraints (skipped 712 transitions) in 63 ms.
[2026-05-24 04:27:31] [INFO ] Added : 3 causal constraints over 1 iterations in 188 ms. Result :sat
Minimization took 446 ms.
[2026-05-24 04:27:31] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:27:31] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-24 04:27:31] [INFO ] [Real]Added 125 Read/Feed constraints in 22 ms returned sat
[2026-05-24 04:27:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:27:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-24 04:27:31] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2026-05-24 04:27:32] [INFO ] [Nat]Added 125 Read/Feed constraints in 24 ms returned sat
[2026-05-24 04:27:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2026-05-24 04:27:32] [INFO ] Computed and/alt/rep : 408/1667/408 causal constraints (skipped 712 transitions) in 65 ms.
[2026-05-24 04:27:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 897 ms
[2026-05-24 04:27:33] [INFO ] Added : 13 causal constraints over 3 iterations in 1222 ms. Result :sat
Minimization took 553 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 1246/1246 transitions.
Applied a total of 0 rules in 15 ms. Remains 162 /162 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 162/162 places, 1246/1246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 1246/1246 transitions.
Applied a total of 0 rules in 14 ms. Remains 162 /162 variables (removed 0) and now considering 1246/1246 (removed 0) transitions.
[2026-05-24 04:27:34] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
[2026-05-24 04:27:34] [INFO ] Invariant cache hit.
[2026-05-24 04:27:34] [INFO ] Implicit Places using invariants in 169 ms returned []
[2026-05-24 04:27:34] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
[2026-05-24 04:27:34] [INFO ] Invariant cache hit.
[2026-05-24 04:27:34] [INFO ] State equation strengthened by 125 read => feed constraints.
[2026-05-24 04:27:35] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
[2026-05-24 04:27:35] [INFO ] Redundant transitions in 37 ms returned []
Running 1245 sub problems to find dead transitions.
[2026-05-24 04:27:35] [INFO ] Flow matrix only has 1121 transitions (discarded 125 similar events)
[2026-05-24 04:27:35] [INFO ] Invariant cache hit.
[2026-05-24 04:27:35] [INFO ] State equation strengthened by 125 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1245 unsolved
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD953 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD965 is UNSAT
Problem TDEAD966 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD969 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD985 is UNSAT
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 8/16 constraints. Problems are: Problem set: 57 solved, 1188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 57 solved, 1188 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 1121/1283 variables, 162/178 constraints. Problems are: Problem set: 57 solved, 1188 unsolved
SMT process timed out in 31498ms, After SMT, problems are : Problem set: 57 solved, 1188 unsolved
Search for dead transitions found 57 dead transitions in 31503ms
Found 57 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 57 transitions
Dead transitions reduction (with SMT) removed 57 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 162/162 places, 1189/1246 transitions.
Graph (complete) has 1574 edges and 162 vertex of which 159 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 12 places and 247 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 147 transition count 942
Reduce places removed 9 places and 117 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 22 place count 138 transition count 825
Reduce places removed 6 places and 61 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 132 transition count 764
Reduce places removed 2 places and 10 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 130 transition count 754
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 31 place count 129 transition count 741
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 34 place count 126 transition count 710
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 39 place count 124 transition count 680
Applied a total of 39 rules in 28 ms. Remains 124 /162 variables (removed 38) and now considering 680/1189 (removed 509) transitions.
[2026-05-24 04:28:06] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1085893032271976267.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14379603313203516720.kers'
[2026-05-24 04:28:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1085893032271976267.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14379603313203516720.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 598 rows 124 cols 2699 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 04:28:06] [INFO ] Computed 7 invariants in 6 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14379603313203516720.kers
Total runtime 8 ms.
[2026-05-24 04:28:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-24 04:28:07] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
[2026-05-24 04:28:07] [INFO ] Invariant cache hit.
[2026-05-24 04:28:07] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 04:28:07] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 124/162 places, 680/1246 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 33351 ms. Remains : 124/162 places, 680/1246 transitions.
[2026-05-24 04:28:07] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
findPositiveTsemiflow completed in 92 ms - Found solution {1=1, 13=1, 258=1, 270=1, 287=1, 498=1, 502=1, 577=1} and attempted to minimize in 0 ms success -> {2=1, 502=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2471715122736331471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11982986491317920534.kers'
[2026-05-24 04:28:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2471715122736331471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11982986491317920534.kers]
Normalized transition count is 598 out of 680 initially.
Culled 0 columns in 1 ms.
// Phase 1: matrix 598 rows 124 cols 2699 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 04:28:17] [INFO ] Computed 7 invariants in 5 ms
Computed 7 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11982986491317920534.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
RANDOM walk for 1000000 steps (4 resets) in 1810 ms. (552 steps per ms)
BEST_FIRST walk for 3000003 steps (7 resets) in 2083 ms. (1439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
[2026-05-24 04:28:21] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3244022233557978217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9616905190489638869.kers'
[2026-05-24 04:28:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3244022233557978217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9616905190489638869.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 598 rows 124 cols 2699 entries
Finished phase 1 with 117 SingleSign rule and 0 generalized
[2026-05-24 04:28:21] [INFO ] Computed 7 invariants in 7 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9616905190489638869.kers
Total runtime 10 ms.
[2026-05-24 04:28:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:28:21] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2026-05-24 04:28:21] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 04:28:21] [INFO ] [Real]Added 81 Read/Feed constraints in 14 ms returned sat
[2026-05-24 04:28:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:28:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:28:21] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-24 04:28:21] [INFO ] [Nat]Added 81 Read/Feed constraints in 26 ms returned sat
[2026-05-24 04:28:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 514 ms
[2026-05-24 04:28:22] [INFO ] Computed and/alt/rep : 311/1335/311 causal constraints (skipped 286 transitions) in 24 ms.
[2026-05-24 04:28:22] [INFO ] Added : 24 causal constraints over 6 iterations in 257 ms. Result :sat
Minimization took 139 ms.
[2026-05-24 04:28:22] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:28:23] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-24 04:28:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:28:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:28:23] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2026-05-24 04:28:23] [INFO ] [Nat]Added 81 Read/Feed constraints in 21 ms returned sat
[2026-05-24 04:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2026-05-24 04:28:23] [INFO ] Computed and/alt/rep : 311/1335/311 causal constraints (skipped 286 transitions) in 28 ms.
[2026-05-24 04:28:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2026-05-24 04:28:23] [INFO ] Added : 8 causal constraints over 3 iterations in 328 ms. Result :sat
Minimization took 152 ms.
[2026-05-24 04:28:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:28:23] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-24 04:28:24] [INFO ] [Real]Added 81 Read/Feed constraints in 15 ms returned sat
[2026-05-24 04:28:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:28:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:28:24] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2026-05-24 04:28:24] [INFO ] [Nat]Added 81 Read/Feed constraints in 17 ms returned sat
[2026-05-24 04:28:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2026-05-24 04:28:24] [INFO ] Computed and/alt/rep : 311/1335/311 causal constraints (skipped 286 transitions) in 31 ms.
[2026-05-24 04:28:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2026-05-24 04:28:24] [INFO ] Added : 42 causal constraints over 9 iterations in 487 ms. Result :sat
Minimization took 155 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 3] Max Struct:[+inf, +inf, +inf]
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 680/680 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 680/680 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 124/124 places, 680/680 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 680/680 transitions.
Applied a total of 0 rules in 7 ms. Remains 124 /124 variables (removed 0) and now considering 680/680 (removed 0) transitions.
[2026-05-24 04:28:25] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
[2026-05-24 04:28:25] [INFO ] Invariant cache hit.
[2026-05-24 04:28:25] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-24 04:28:25] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
[2026-05-24 04:28:25] [INFO ] Invariant cache hit.
[2026-05-24 04:28:25] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-24 04:28:25] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2026-05-24 04:28:25] [INFO ] Redundant transitions in 7 ms returned []
Running 679 sub problems to find dead transitions.
[2026-05-24 04:28:25] [INFO ] Flow matrix only has 598 transitions (discarded 82 similar events)
[2026-05-24 04:28:25] [INFO ] Invariant cache hit.
[2026-05-24 04:28:25] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 679 unsolved
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD679 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 598/722 variables, 124/132 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/722 variables, 81/213 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 0/213 constraints. Problems are: Problem set: 4 solved, 675 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/722 variables, 0/213 constraints. Problems are: Problem set: 4 solved, 675 unsolved
No progress, stopping.
After SMT solving in domain Real declared 722/722 variables, and 213 constraints, problems are : Problem set: 4 solved, 675 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 679/679 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 3 (OVERLAPS) 598/722 variables, 124/132 constraints. Problems are: Problem set: 4 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/722 variables, 81/213 constraints. Problems are: Problem set: 4 solved, 675 unsolved
Problem TDEAD63 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD672 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/722 variables, 675/888 constraints. Problems are: Problem set: 97 solved, 582 unsolved
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 8/896 constraints. Problems are: Problem set: 147 solved, 532 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 722/722 variables, and 896 constraints, problems are : Problem set: 147 solved, 532 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 124/124 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 675/679 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60396ms problems are : Problem set: 147 solved, 532 unsolved
Search for dead transitions found 147 dead transitions in 60399ms
Found 147 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 147 transitions
Dead transitions reduction (with SMT) removed 147 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 124/124 places, 533/680 transitions.
Graph (complete) has 782 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 14 places and 141 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 107 transition count 392
Reduce places removed 2 places and 16 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 105 transition count 376
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 104 transition count 368
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 103 transition count 363
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 24 place count 98 transition count 318
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 29 place count 98 transition count 318
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 29 rules in 11 ms. Remains 98 /124 variables (removed 26) and now considering 318/533 (removed 215) transitions.
[2026-05-24 04:29:26] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18250707960875469801.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5926138133774395117.kers'
[2026-05-24 04:29:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18250707960875469801.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5926138133774395117.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 297 rows 97 cols 1307 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 04:29:26] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5926138133774395117.kers
Total runtime 3 ms.
[2026-05-24 04:29:26] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-24 04:29:26] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-24 04:29:26] [INFO ] Invariant cache hit.
[2026-05-24 04:29:26] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 04:29:26] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 98/124 places, 318/680 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61348 ms. Remains : 98/124 places, 318/680 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA BugTracking-PT-q8m004-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (after structural reductions) : Max Seen:[1, 3] Max Struct:[+inf, +inf]
[2026-05-24 04:29:26] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
findPositiveTsemiflow completed in 51 ms - Found solution {3=1, 38=1, 224=1, 282=1} and attempted to minimize in 0 ms success -> {4=1, 224=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[1, 3] Max Struct:[+inf, +inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5986986691198628650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-300041356096816389.kers'
[2026-05-24 04:29:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5986986691198628650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-300041356096816389.kers]
Normalized transition count is 297 out of 318 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 97 cols 1307 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 04:29:36] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-300041356096816389.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 3] Max Struct:[+inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 1262 ms. (791 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1151 ms. (1736 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 3] Max Struct:[+inf, +inf]
[2026-05-24 04:29:39] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14443565245518702792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9208009313584268855.kers'
[2026-05-24 04:29:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14443565245518702792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9208009313584268855.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 97 cols 1307 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 04:29:39] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9208009313584268855.kers
Total runtime 4 ms.
[2026-05-24 04:29:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:29:39] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2026-05-24 04:29:39] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:29:39] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-24 04:29:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 04:29:39] [INFO ] [Real]Added 60 Read/Feed constraints in 8 ms returned sat
[2026-05-24 04:29:39] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:29:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-24 04:29:39] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2026-05-24 04:29:39] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2026-05-24 04:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-24 04:29:39] [INFO ] Computed and/alt/rep : 206/991/206 causal constraints (skipped 90 transitions) in 13 ms.
[2026-05-24 04:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2026-05-24 04:29:39] [INFO ] Added : 39 causal constraints over 9 iterations in 269 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 3] Max Struct:[1, +inf]
FORMULA BugTracking-PT-q8m004-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 97/97 places, 318/318 transitions.
[2026-05-24 04:29:39] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
findPositiveTsemiflow completed in 52 ms - Found solution {3=1, 38=1, 224=1, 282=1} and attempted to minimize in 0 ms success -> {4=1, 224=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14889542488173598250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10229593264178369446.kers'
[2026-05-24 04:29:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14889542488173598250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10229593264178369446.kers]
Normalized transition count is 297 out of 318 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 97 cols 1307 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 04:29:49] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10229593264178369446.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1308 ms. (763 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 566 ms. (1763 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-24 04:29:51] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4228709130107084830.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13326214467999508917.kers'
[2026-05-24 04:29:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4228709130107084830.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13326214467999508917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 297 rows 97 cols 1307 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-24 04:29:51] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13326214467999508917.kers
Total runtime 4 ms.
[2026-05-24 04:29:51] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:29:51] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2026-05-24 04:29:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 04:29:51] [INFO ] [Real]Added 60 Read/Feed constraints in 6 ms returned sat
[2026-05-24 04:29:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:29:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-24 04:29:52] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2026-05-24 04:29:52] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2026-05-24 04:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2026-05-24 04:29:52] [INFO ] Computed and/alt/rep : 206/991/206 causal constraints (skipped 90 transitions) in 12 ms.
[2026-05-24 04:29:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2026-05-24 04:29:52] [INFO ] Added : 39 causal constraints over 9 iterations in 271 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 318/318 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 318/318 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 318/318 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 318/318 (removed 0) transitions.
[2026-05-24 04:29:52] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-24 04:29:52] [INFO ] Invariant cache hit.
[2026-05-24 04:29:52] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-24 04:29:52] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-24 04:29:52] [INFO ] Invariant cache hit.
[2026-05-24 04:29:52] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 04:29:52] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2026-05-24 04:29:52] [INFO ] Redundant transitions in 2 ms returned []
Running 317 sub problems to find dead transitions.
[2026-05-24 04:29:52] [INFO ] Flow matrix only has 297 transitions (discarded 21 similar events)
[2026-05-24 04:29:52] [INFO ] Invariant cache hit.
[2026-05-24 04:29:52] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
At refinement iteration 2 (OVERLAPS) 297/394 variables, 97/104 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 60/164 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 1/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 165 constraints, problems are : Problem set: 3 solved, 314 unsolved in 14758 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 297/394 variables, 97/105 constraints. Problems are: Problem set: 3 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 60/165 constraints. Problems are: Problem set: 3 solved, 314 unsolved
Problem TDEAD146 is UNSAT
Problem TDEAD151 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 314/479 constraints. Problems are: Problem set: 5 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 3/482 constraints. Problems are: Problem set: 5 solved, 312 unsolved
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/483 constraints. Problems are: Problem set: 10 solved, 307 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/394 variables, and 487 constraints, problems are : Problem set: 10 solved, 307 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 97/97 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 314/317 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 44852ms problems are : Problem set: 10 solved, 307 unsolved
Search for dead transitions found 10 dead transitions in 44853ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 97/97 places, 308/318 transitions.
Reduce places removed 1 places and 9 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 96 transition count 299
Applied a total of 1 rules in 4 ms. Remains 96 /97 variables (removed 1) and now considering 299/308 (removed 9) transitions.
[2026-05-24 04:30:37] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11339806869656920243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17628360085534374470.kers'
[2026-05-24 04:30:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11339806869656920243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17628360085534374470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 96 cols 1222 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:30:37] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17628360085534374470.kers
Total runtime 2 ms.
[2026-05-24 04:30:37] [INFO ] Implicit Places using invariants in 144 ms returned []
[2026-05-24 04:30:37] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-24 04:30:37] [INFO ] Invariant cache hit.
[2026-05-24 04:30:38] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 04:30:38] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 96/97 places, 299/318 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 45669 ms. Remains : 96/97 places, 299/318 transitions.
[2026-05-24 04:30:38] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
findPositiveTsemiflow completed in 63 ms - Found solution {4=1, 206=1} and attempted to minimize in 0 ms success -> {4=1, 206=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4492127672162142441.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1010618724454330159.kers'
[2026-05-24 04:30:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4492127672162142441.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1010618724454330159.kers]
Normalized transition count is 279 out of 299 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 96 cols 1222 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:30:48] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1010618724454330159.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 1398 ms. (714 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 567 ms. (1760 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-24 04:30:50] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4403364296565151912.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9645112828254255627.kers'
[2026-05-24 04:30:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4403364296565151912.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9645112828254255627.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 279 rows 96 cols 1222 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:30:50] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9645112828254255627.kers
Total runtime 2 ms.
[2026-05-24 04:30:50] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:30:50] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-24 04:30:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 04:30:50] [INFO ] [Real]Added 59 Read/Feed constraints in 9 ms returned sat
[2026-05-24 04:30:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:30:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:30:50] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-24 04:30:50] [INFO ] [Nat]Added 59 Read/Feed constraints in 9 ms returned sat
[2026-05-24 04:30:50] [INFO ] Computed and/alt/rep : 231/1293/231 causal constraints (skipped 47 transitions) in 19 ms.
[2026-05-24 04:30:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 444 ms
[2026-05-24 04:30:51] [INFO ] Added : 25 causal constraints over 6 iterations in 576 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 299/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 299/299 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 299/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2026-05-24 04:30:51] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-24 04:30:51] [INFO ] Invariant cache hit.
[2026-05-24 04:30:51] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-24 04:30:51] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-24 04:30:51] [INFO ] Invariant cache hit.
[2026-05-24 04:30:51] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-24 04:30:51] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2026-05-24 04:30:51] [INFO ] Redundant transitions in 1 ms returned []
Running 298 sub problems to find dead transitions.
[2026-05-24 04:30:51] [INFO ] Flow matrix only has 279 transitions (discarded 20 similar events)
[2026-05-24 04:30:51] [INFO ] Invariant cache hit.
[2026-05-24 04:30:51] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 2 (OVERLAPS) 279/375 variables, 96/103 constraints. Problems are: Problem set: 32 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 59/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 0/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/375 variables, 0/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 375/375 variables, and 162 constraints, problems are : Problem set: 32 solved, 266 unsolved in 6148 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 279/375 variables, 96/103 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 59/162 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 266/428 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 3/431 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/375 variables, 11/442 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/375 variables, 1/443 constraints. Problems are: Problem set: 32 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/375 variables, 2/445 constraints. Problems are: Problem set: 32 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 375/375 variables, and 446 constraints, problems are : Problem set: 32 solved, 266 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 266/298 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 36245ms problems are : Problem set: 32 solved, 266 unsolved
Search for dead transitions found 32 dead transitions in 36247ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/96 places, 267/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 04:31:27] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 36648 ms. Remains : 96/96 places, 267/299 transitions.
[2026-05-24 04:31:27] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
findPositiveTsemiflow completed in 58 ms - Found solution {1=1, 174=1} and attempted to minimize in 1 ms success -> {4=1, 174=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8110395380074689442.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4545760733896962574.kers'
[2026-05-24 04:31:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8110395380074689442.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4545760733896962574.kers]
Normalized transition count is 247 out of 267 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 96 cols 1074 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:31:37] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4545760733896962574.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (3 resets) in 1466 ms. (681 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 616 ms. (1620 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-24 04:31:40] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3961414370276859501.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9221066784235459569.kers'
[2026-05-24 04:31:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3961414370276859501.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9221066784235459569.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 96 cols 1074 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:31:40] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9221066784235459569.kers
Total runtime 9 ms.
[2026-05-24 04:31:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:31:40] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2026-05-24 04:31:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:31:40] [INFO ] [Real]Added 55 Read/Feed constraints in 8 ms returned sat
[2026-05-24 04:31:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:31:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:31:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2026-05-24 04:31:40] [INFO ] [Nat]Added 55 Read/Feed constraints in 17 ms returned sat
[2026-05-24 04:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2026-05-24 04:31:40] [INFO ] Computed and/alt/rep : 212/1072/212 causal constraints (skipped 34 transitions) in 13 ms.
[2026-05-24 04:31:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2026-05-24 04:31:40] [INFO ] Added : 43 causal constraints over 9 iterations in 232 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 7 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 04:31:40] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:31:40] [INFO ] Invariant cache hit.
[2026-05-24 04:31:40] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 04:31:40] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:31:40] [INFO ] Invariant cache hit.
[2026-05-24 04:31:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:31:41] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2026-05-24 04:31:41] [INFO ] Redundant transitions in 2 ms returned []
Running 266 sub problems to find dead transitions.
[2026-05-24 04:31:41] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:31:41] [INFO ] Invariant cache hit.
[2026-05-24 04:31:41] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 10272 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 247/343 variables, 96/103 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 55/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/343 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 343/343 variables, and 434 constraints, problems are : Problem set: 0 solved, 266 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 40347ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 40348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40675 ms. Remains : 96/96 places, 267/267 transitions.
[2026-05-24 04:32:21] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
findPositiveTsemiflow completed in 40 ms - Found solution {1=1, 174=1} and attempted to minimize in 0 ms success -> {4=1, 174=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40003 steps (10 resets) in 485 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2026-05-24 04:32:32] [INFO ] Flatten gal took : 118 ms
[2026-05-24 04:32:32] [INFO ] Flatten gal took : 40 ms
[2026-05-24 04:32:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3514518702344754768.gal : 41 ms
[2026-05-24 04:32:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1223980929537848341.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/ReachabilityCardinality3514518702344754768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1223980929537848341.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1223980929537848341.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 249
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :249 after 574
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :574 after 1219
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1219 after 2504
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2504 after 5069
Interrupted probabilistic random walk after 1213363 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :0 out of 1
Probabilistic random walk after 1213363 steps, saw 728861 distinct states, run finished after 3010 ms. (steps per millisecond=403 ) properties seen :0
[2026-05-24 04:32:34] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:32:34] [INFO ] Invariant cache hit.
[2026-05-24 04:32:34] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 96/96 places, 267/267 transitions.
RANDOM walk for 40003 steps (9 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5069 after 10194
Interrupted probabilistic random walk after 1272693 steps, run timeout after 3001 ms. (steps per millisecond=424 ) properties seen :0 out of 1
Probabilistic random walk after 1272693 steps, saw 747709 distinct states, run finished after 3001 ms. (steps per millisecond=424 ) properties seen :0
[2026-05-24 04:32:38] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:32:38] [INFO ] Invariant cache hit.
[2026-05-24 04:32:38] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 317ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 04:32:38] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:32:38] [INFO ] Invariant cache hit.
[2026-05-24 04:32:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 04:32:38] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:32:38] [INFO ] Invariant cache hit.
[2026-05-24 04:32:38] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:32:38] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2026-05-24 04:32:38] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 96/96 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 401 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 92 transition count 246
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 77 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 77 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 77 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 76 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 76 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 75 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 75 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 75 transition count 170
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 3 with 10 rules applied. Total rules applied 69 place count 70 transition count 165
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 66 transition count 183
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 66 transition count 178
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 87 place count 61 transition count 178
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 61 transition count 178
Applied a total of 89 rules in 23 ms. Remains 61 /96 variables (removed 35) and now considering 178/267 (removed 89) 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-4520485866357571965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9235188242264188279.kers'
[2026-05-24 04:32:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4520485866357571965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9235188242264188279.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 178 rows 58 cols 636 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 04:32:38] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9235188242264188279.kers
Total runtime 1 ms.
[2026-05-24 04:32:38] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-24 04:32:38] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 04:32:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-24 04:32:38] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 04:32:38] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 04:32:38] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 04:32:38] [INFO ] Flatten gal took : 19 ms
[2026-05-24 04:32:38] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:32:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15711865020684157625.gal : 7 ms
[2026-05-24 04:32:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1025817701670798459.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/ReachabilityCardinality15711865020684157625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1025817701670798459.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/ReachabilityCardinality1025817701670798459.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 109
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :109 after 274
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :274 after 599
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :599 after 1244
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1244 after 2529
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2529 after 5094
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5094 after 10219
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10194 after 20439
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10219 after 20464
Detected timeout of ITS tools.
[2026-05-24 04:32:54] [INFO ] Flatten gal took : 14 ms
[2026-05-24 04:32:54] [INFO ] Applying decomposition
[2026-05-24 04:32:54] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17275758216585179587.txt' '-o' '/tmp/graph17275758216585179587.bin' '-w' '/tmp/graph17275758216585179587.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17275758216585179587.bin' '-l' '-1' '-v' '-w' '/tmp/graph17275758216585179587.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:32:54] [INFO ] Decomposing Gal with order
[2026-05-24 04:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:32:54] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-24 04:32:54] [INFO ] Flatten gal took : 68 ms
[2026-05-24 04:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 3 ms.
[2026-05-24 04:32:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1678884154333099571.gal : 6 ms
[2026-05-24 04:32:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1975366046378771787.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/ReachabilityCardinality1678884154333099571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1975366046378771787.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
Loading property file /tmp/ReachabilityCardinality1975366046378771787.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 61
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :61 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 81
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :81 after 1027
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1027 after 5702
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 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\_mod\_flat,200676,0.046563,5668,36,848,258,4025,99,279,241,9630,0
Total reachable state count : 200676

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,100,0.047184,5908,12,96,258,4025,103,279,245,9630,0
Over-approximation ignoring read arcs solved 0 properties in 15520 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 04:32:54] [INFO ] Flatten gal took : 18 ms
[2026-05-24 04:32:54] [INFO ] Applying decomposition
[2026-05-24 04:32:54] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12496804001186761962.txt' '-o' '/tmp/graph12496804001186761962.bin' '-w' '/tmp/graph12496804001186761962.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12496804001186761962.bin' '-l' '-1' '-v' '-w' '/tmp/graph12496804001186761962.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:32:54] [INFO ] Decomposing Gal with order
[2026-05-24 04:32:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:32:54] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-24 04:32:54] [INFO ] Flatten gal took : 22 ms
[2026-05-24 04:32:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 1 ms.
[2026-05-24 04:32:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10687310052560064475.gal : 4 ms
[2026-05-24 04:32:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2450895392826041680.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/ReachabilityCardinality10687310052560064475.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2450895392826041680.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality2450895392826041680.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 75
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :75 after 273
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :273 after 388
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :388 after 508
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :508 after 1004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1004 after 2432
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2432 after 4585
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4585 after 11317
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :11317 after 28840
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :28840 after 85850
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :85850 after 247592
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :247592 after 714272
Detected timeout of ITS tools.
Starting property specific reduction for BugTracking-PT-q8m004-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11607802627702512010.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12210544509170561414.kers'
[2026-05-24 04:33:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11607802627702512010.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12210544509170561414.kers]
Normalized transition count is 247 out of 267 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 96 cols 1074 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:33:44] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12210544509170561414.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[+inf]
[2026-05-24 04:33:44] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8661259934587358115.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16082194521032639222.kers'
[2026-05-24 04:33:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8661259934587358115.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16082194521032639222.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 96 cols 1074 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:33:44] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16082194521032639222.kers
Total runtime 4 ms.
[2026-05-24 04:33:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:33:44] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2026-05-24 04:33:44] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:33:44] [INFO ] [Real]Added 55 Read/Feed constraints in 7 ms returned sat
[2026-05-24 04:33:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:33:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2026-05-24 04:33:44] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2026-05-24 04:33:44] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2026-05-24 04:33:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2026-05-24 04:33:44] [INFO ] Computed and/alt/rep : 212/1072/212 causal constraints (skipped 34 transitions) in 16 ms.
[2026-05-24 04:33:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2026-05-24 04:33:45] [INFO ] Added : 45 causal constraints over 10 iterations in 388 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
[2026-05-24 04:33:45] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
findPositiveTsemiflow completed in 42 ms - Found solution {1=1, 174=1} and attempted to minimize in 0 ms success -> {4=1, 174=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-635767059190569592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2199481207292614565.kers'
[2026-05-24 04:33:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-635767059190569592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2199481207292614565.kers]
Normalized transition count is 247 out of 267 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 96 cols 1074 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:33:55] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2199481207292614565.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 1458 ms. (685 steps per ms)
BEST_FIRST walk for 1000001 steps (3 resets) in 615 ms. (1623 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2026-05-24 04:33:57] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9489027479804183708.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14097275283151756354.kers'
[2026-05-24 04:33:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9489027479804183708.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14097275283151756354.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 96 cols 1074 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-24 04:33:57] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14097275283151756354.kers
Total runtime 4 ms.
[2026-05-24 04:33:57] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-24 04:33:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-24 04:33:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:33:57] [INFO ] [Real]Added 55 Read/Feed constraints in 13 ms returned sat
[2026-05-24 04:33:57] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 04:33:57] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2026-05-24 04:33:57] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2026-05-24 04:33:57] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2026-05-24 04:33:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2026-05-24 04:33:57] [INFO ] Computed and/alt/rep : 212/1072/212 causal constraints (skipped 34 transitions) in 15 ms.
[2026-05-24 04:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2026-05-24 04:33:58] [INFO ] Added : 43 causal constraints over 9 iterations in 254 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 04:33:58] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:33:58] [INFO ] Invariant cache hit.
[2026-05-24 04:33:58] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 04:33:58] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:33:58] [INFO ] Invariant cache hit.
[2026-05-24 04:33:58] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:33:58] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2026-05-24 04:33:58] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 96/96 places, 267/267 transitions.
[2026-05-24 04:33:58] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
findPositiveTsemiflow completed in 42 ms - Found solution {1=1, 174=1} and attempted to minimize in 0 ms success -> {4=1, 174=1}
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2026-05-24 04:34:08] [INFO ] Flatten gal took : 13 ms
[2026-05-24 04:34:08] [INFO ] Flatten gal took : 18 ms
[2026-05-24 04:34:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16557487259765241969.gal : 3 ms
[2026-05-24 04:34:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6827946946834112008.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/ReachabilityCardinality16557487259765241969.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6827946946834112008.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
RANDOM walk for 40002 steps (12 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality6827946946834112008.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 249
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :249 after 574
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :574 after 1219
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1219 after 2504
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2504 after 5069
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5069 after 10194
Interrupted probabilistic random walk after 1251098 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 1
Probabilistic random walk after 1251098 steps, saw 740838 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
[2026-05-24 04:34:11] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:34:11] [INFO ] Invariant cache hit.
[2026-05-24 04:34:11] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 334ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
RANDOM walk for 40002 steps (9 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1266458 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :0 out of 1
Probabilistic random walk after 1266458 steps, saw 745753 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :0
[2026-05-24 04:34:15] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:34:15] [INFO ] Invariant cache hit.
[2026-05-24 04:34:15] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 75/247 variables, 11/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/247 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/251 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/251 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 52/303 variables, 32/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/303 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 8/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 39/342 variables, 15/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/342 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 6/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/343 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/343 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 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) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 113/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 24/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/123 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 49/172 variables, 24/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/172 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 75/247 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/247 variables, 15/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/247 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/251 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/251 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 52/303 variables, 32/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/303 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 8/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 39/342 variables, 15/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/342 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/342 variables, 6/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/342 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1/343 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/343 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/343 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 96/96 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 267/267 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2026-05-24 04:34:15] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:34:15] [INFO ] Invariant cache hit.
[2026-05-24 04:34:15] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-24 04:34:15] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
[2026-05-24 04:34:15] [INFO ] Invariant cache hit.
[2026-05-24 04:34:15] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-24 04:34:15] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2026-05-24 04:34:15] [INFO ] Redundant transitions in 1 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 96/96 places, 267/267 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 401 edges and 96 vertex of which 92 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 92 transition count 246
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 37 place count 77 transition count 177
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 77 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 77 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 76 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 76 transition count 174
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 75 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 75 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 75 transition count 170
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 3 with 10 rules applied. Total rules applied 69 place count 70 transition count 165
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 77 place count 66 transition count 183
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 66 transition count 178
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 87 place count 61 transition count 178
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 61 transition count 178
Applied a total of 89 rules in 15 ms. Remains 61 /96 variables (removed 35) and now considering 178/267 (removed 89) 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-3432901908594834380.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4172636421363494727.kers'
[2026-05-24 04:34:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3432901908594834380.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4172636421363494727.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 178 rows 58 cols 636 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-24 04:34:15] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4172636421363494727.kers
Total runtime 0 ms.
[2026-05-24 04:34:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-24 04:34:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-24 04:34:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-24 04:34:15] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-24 04:34:16] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-24 04:34:16] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-24 04:34:16] [INFO ] Flatten gal took : 13 ms
[2026-05-24 04:34:16] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:34:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18436881297713611719.gal : 1 ms
[2026-05-24 04:34:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2696577620185680060.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/ReachabilityCardinality18436881297713611719.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2696577620185680060.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/ReachabilityCardinality2696577620185680060.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 109
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :109 after 274
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :274 after 599
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :599 after 1244
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1244 after 2529
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2529 after 5094
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5094 after 10219
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10194 after 20439
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :10219 after 20464
Detected timeout of ITS tools.
[2026-05-24 04:34:31] [INFO ] Flatten gal took : 7 ms
[2026-05-24 04:34:31] [INFO ] Applying decomposition
[2026-05-24 04:34:31] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5617117015882728852.txt' '-o' '/tmp/graph5617117015882728852.bin' '-w' '/tmp/graph5617117015882728852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5617117015882728852.bin' '-l' '-1' '-v' '-w' '/tmp/graph5617117015882728852.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:34:31] [INFO ] Decomposing Gal with order
[2026-05-24 04:34:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:34:31] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-24 04:34:31] [INFO ] Flatten gal took : 12 ms
[2026-05-24 04:34:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 4 ms.
[2026-05-24 04:34:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11431153585621744304.gal : 2 ms
[2026-05-24 04:34:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6398737168171668478.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/ReachabilityCardinality11431153585621744304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6398737168171668478.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality6398737168171668478.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 61
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :61 after 68
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :68 after 81
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :81 after 1100
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1100 after 6530
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 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\_mod\_flat,200676,0.047092,5688,36,848,265,4146,99,279,241,9982,0
Total reachable state count : 200676

Verifying 1 reachability properties.
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,300,0.047915,5928,12,130,265,4146,103,279,245,9982,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 15411 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-24 04:34:31] [INFO ] Flatten gal took : 29 ms
[2026-05-24 04:34:31] [INFO ] Applying decomposition
[2026-05-24 04:34:31] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15434983166574042079.txt' '-o' '/tmp/graph15434983166574042079.bin' '-w' '/tmp/graph15434983166574042079.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15434983166574042079.bin' '-l' '-1' '-v' '-w' '/tmp/graph15434983166574042079.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:34:31] [INFO ] Decomposing Gal with order
[2026-05-24 04:34:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:34:31] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-24 04:34:31] [INFO ] Flatten gal took : 22 ms
[2026-05-24 04:34:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 1 ms.
[2026-05-24 04:34:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12415727117270980108.gal : 3 ms
[2026-05-24 04:34:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7487136769710526690.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/ReachabilityCardinality12415727117270980108.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7487136769710526690.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality7487136769710526690.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 20
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :20 after 87
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :87 after 194
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :194 after 368
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :368 after 606
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :606 after 1060
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1060 after 2321
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2321 after 4846
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :4846 after 9074
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :9074 after 23789
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :23789 after 75497
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :75497 after 226617
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :226617 after 671608
Detected timeout of ITS tools.
Ending property specific reduction for BugTracking-PT-q8m004-UpperBounds-04 in 96976 ms.
[2026-05-24 04:35:21] [INFO ] Flatten gal took : 8 ms
[2026-05-24 04:35:21] [INFO ] Applying decomposition
[2026-05-24 04:35:21] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1401620455114520755.txt' '-o' '/tmp/graph1401620455114520755.bin' '-w' '/tmp/graph1401620455114520755.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1401620455114520755.bin' '-l' '-1' '-v' '-w' '/tmp/graph1401620455114520755.weights' '-q' '0' '-e' '0.001'
[2026-05-24 04:35:21] [INFO ] Decomposing Gal with order
[2026-05-24 04:35:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 04:35:21] [INFO ] Removed a total of 6 redundant transitions.
[2026-05-24 04:35:21] [INFO ] Flatten gal took : 14 ms
[2026-05-24 04:35:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 0 ms.
[2026-05-24 04:35:21] [INFO ] Time to serialize gal into /tmp/UpperBounds14261058595444413580.gal : 2 ms
[2026-05-24 04:35:21] [INFO ] Time to serialize properties into /tmp/UpperBounds16882573531549682337.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/UpperBounds14261058595444413580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16882573531549682337.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 ...285
Loading property file /tmp/UpperBounds16882573531549682337.prop.
Detected timeout of ITS tools.
[2026-05-24 04:59:16] [INFO ] Flatten gal took : 209 ms
[2026-05-24 04:59:16] [INFO ] Time to serialize gal into /tmp/UpperBounds11717608601494461313.gal : 83 ms
[2026-05-24 04:59:16] [INFO ] Time to serialize properties into /tmp/UpperBounds4978991858547438115.prop : 8 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/UpperBounds11717608601494461313.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4978991858547438115.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 ...305
Loading property file /tmp/UpperBounds4978991858547438115.prop.
Detected timeout of ITS tools.
[2026-05-24 05:23:00] [INFO ] Flatten gal took : 35 ms
[2026-05-24 05:23:01] [INFO ] Input system was already deterministic with 267 transitions.
[2026-05-24 05:23:01] [INFO ] Transformed 96 places.
[2026-05-24 05:23:01] [INFO ] Transformed 267 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 05:23:01] [INFO ] Time to serialize gal into /tmp/UpperBounds3659757095845080934.gal : 7 ms
[2026-05-24 05:23:01] [INFO ] Time to serialize properties into /tmp/UpperBounds477177851176584575.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/UpperBounds3659757095845080934.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds477177851176584575.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...348
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds477177851176584575.prop.

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m004"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BugTracking-PT-q8m004, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946841900397"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m004.tgz
mv BugTracking-PT-q8m004 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;