Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366300413.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-09a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366300413
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 5 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 839K 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 ASLink-PT-09a-UpperBounds-00
FORMULA_NAME ASLink-PT-09a-UpperBounds-01
FORMULA_NAME ASLink-PT-09a-UpperBounds-02
FORMULA_NAME ASLink-PT-09a-UpperBounds-03
FORMULA_NAME ASLink-PT-09a-UpperBounds-04
FORMULA_NAME ASLink-PT-09a-UpperBounds-05
FORMULA_NAME ASLink-PT-09a-UpperBounds-06
FORMULA_NAME ASLink-PT-09a-UpperBounds-07
FORMULA_NAME ASLink-PT-09a-UpperBounds-08
FORMULA_NAME ASLink-PT-09a-UpperBounds-09
FORMULA_NAME ASLink-PT-09a-UpperBounds-10
FORMULA_NAME ASLink-PT-09a-UpperBounds-11
FORMULA_NAME ASLink-PT-09a-UpperBounds-12
FORMULA_NAME ASLink-PT-09a-UpperBounds-13
FORMULA_NAME ASLink-PT-09a-UpperBounds-14
FORMULA_NAME ASLink-PT-09a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779485776097

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 21:36:17] [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-22 21:36:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:36:17] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2026-05-22 21:36:17] [INFO ] Transformed 1991 places.
[2026-05-22 21:36:17] [INFO ] Transformed 2919 transitions.
[2026-05-22 21:36:17] [INFO ] Found NUPN structural information;
[2026-05-22 21:36:17] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15577839344052990417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17556991931614091037.kers'
[2026-05-22 21:36:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15577839344052990417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17556991931614091037.kers]
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 2 ms.
// Phase 1: matrix 2888 rows 1955 cols 10819 entries
Finished phase 1 with 762 SingleSign rule and 845 generalized
[2026-05-22 21:36:17] [INFO ] Computed 384 invariants in 27 ms
Computed 384 P flows in 29 ms.
Exported basis to /tmp/petrispot-output-17556991931614091037.kers
Total runtime 31 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (46 resets) in 98 ms. (101 steps per ms)
FORMULA ASLink-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (28 resets) in 188 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 21:36:18] [INFO ] Invariant cache hit.
[2026-05-22 21:36:18] [INFO ] [Real]Absence check using 90 positive place invariants in 66 ms returned sat
[2026-05-22 21:36:19] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 116 ms returned sat
[2026-05-22 21:36:20] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2026-05-22 21:36:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:36:20] [INFO ] [Nat]Absence check using 90 positive place invariants in 44 ms returned sat
[2026-05-22 21:36:20] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 81 ms returned sat
[2026-05-22 21:36:22] [INFO ] [Nat]Absence check using state equation in 1387 ms returned sat
[2026-05-22 21:36:22] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 251 ms.
[2026-05-22 21:36:25] [INFO ] Added : 75 causal constraints over 15 iterations in 2932 ms. Result :unknown
[2026-05-22 21:36:25] [INFO ] [Real]Absence check using 90 positive place invariants in 55 ms returned sat
[2026-05-22 21:36:26] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 102 ms returned sat
[2026-05-22 21:36:27] [INFO ] [Real]Absence check using state equation in 1571 ms returned sat
[2026-05-22 21:36:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:36:28] [INFO ] [Nat]Absence check using 90 positive place invariants in 63 ms returned sat
[2026-05-22 21:36:28] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 89 ms returned sat
[2026-05-22 21:36:30] [INFO ] [Nat]Absence check using state equation in 1320 ms returned sat
[2026-05-22 21:36:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 397 ms
[2026-05-22 21:36:30] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 222 ms.
[2026-05-22 21:36:33] [INFO ] Added : 70 causal constraints over 14 iterations in 2806 ms. Result :unknown
[2026-05-22 21:36:33] [INFO ] [Real]Absence check using 90 positive place invariants in 46 ms returned sat
[2026-05-22 21:36:33] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 90 ms returned sat
[2026-05-22 21:36:34] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2026-05-22 21:36:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:36:35] [INFO ] [Nat]Absence check using 90 positive place invariants in 45 ms returned sat
[2026-05-22 21:36:35] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 88 ms returned sat
[2026-05-22 21:36:36] [INFO ] [Nat]Absence check using state equation in 1519 ms returned sat
[2026-05-22 21:36:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1125 ms
[2026-05-22 21:36:38] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 198 ms.
Maximisation of solution failed !
Minimization took 3 ms.
[2026-05-22 21:36:40] [INFO ] [Real]Absence check using 90 positive place invariants in 46 ms returned sat
[2026-05-22 21:36:40] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 90 ms returned sat
[2026-05-22 21:36:41] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2026-05-22 21:36:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:36:42] [INFO ] [Nat]Absence check using 90 positive place invariants in 91 ms returned sat
[2026-05-22 21:36:42] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 110 ms returned sat
[2026-05-22 21:36:44] [INFO ] [Nat]Absence check using state equation in 1934 ms returned sat
[2026-05-22 21:36:44] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 317 ms.
[2026-05-22 21:36:46] [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: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
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-22 21:36:47] [INFO ] [Real]Absence check using 90 positive place invariants in 44 ms returned sat
[2026-05-22 21:36:47] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 78 ms returned sat
[2026-05-22 21:36:48] [INFO ] [Real]Absence check using state equation in 1166 ms returned sat
[2026-05-22 21:36:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:36:49] [INFO ] [Nat]Absence check using 90 positive place invariants in 46 ms returned sat
[2026-05-22 21:36:49] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 78 ms returned sat
[2026-05-22 21:36:50] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2026-05-22 21:36:50] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 141 ms.
[2026-05-22 21:36:53] [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 4
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
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-22 21:36:54] [INFO ] [Real]Absence check using 90 positive place invariants in 42 ms returned sat
[2026-05-22 21:36:54] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 88 ms returned sat
[2026-05-22 21:36:55] [INFO ] [Real]Absence check using state equation in 1271 ms returned sat
[2026-05-22 21:36:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:36:55] [INFO ] [Nat]Absence check using 90 positive place invariants in 45 ms returned sat
[2026-05-22 21:36:56] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 91 ms returned sat
[2026-05-22 21:36:57] [INFO ] [Nat]Absence check using state equation in 1874 ms returned sat
[2026-05-22 21:36:58] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 116 ms.
[2026-05-22 21:37:00] [INFO ] Added : 85 causal constraints over 17 iterations in 2601 ms. Result :unknown
[2026-05-22 21:37:01] [INFO ] [Real]Absence check using 90 positive place invariants in 63 ms returned sat
[2026-05-22 21:37:01] [INFO ] [Real]Absence check using 90 positive and 294 generalized place invariants in 80 ms returned sat
[2026-05-22 21:37:02] [INFO ] [Real]Absence check using state equation in 1167 ms returned sat
[2026-05-22 21:37:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:37:02] [INFO ] [Nat]Absence check using 90 positive place invariants in 54 ms returned sat
[2026-05-22 21:37:02] [INFO ] [Nat]Absence check using 90 positive and 294 generalized place invariants in 95 ms returned sat
[2026-05-22 21:37:04] [INFO ] [Nat]Absence check using state equation in 1570 ms returned sat
[2026-05-22 21:37:04] [INFO ] Computed and/alt/rep : 1230/4318/1230 causal constraints (skipped 1657 transitions) in 177 ms.
[2026-05-22 21:37:07] [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 6
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.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1937 transition count 2707
Reduce places removed 181 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 182 rules applied. Total rules applied 417 place count 1756 transition count 2706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 1755 transition count 2706
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 189 Pre rules applied. Total rules applied 418 place count 1755 transition count 2517
Deduced a syphon composed of 189 places in 9 ms
Ensure Unique test removed 74 places
Reduce places removed 263 places and 0 transitions.
Iterating global reduction 3 with 452 rules applied. Total rules applied 870 place count 1492 transition count 2517
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 871 place count 1492 transition count 2516
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 872 place count 1491 transition count 2516
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 884 place count 1479 transition count 2451
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 897 place count 1478 transition count 2451
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 903 place count 1477 transition count 2446
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 906 place count 1474 transition count 2446
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 907 place count 1473 transition count 2438
Iterating global reduction 7 with 1 rules applied. Total rules applied 908 place count 1473 transition count 2438
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 1472 transition count 2430
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 1472 transition count 2430
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 911 place count 1471 transition count 2422
Iterating global reduction 7 with 1 rules applied. Total rules applied 912 place count 1471 transition count 2422
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 913 place count 1470 transition count 2414
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 1470 transition count 2414
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 915 place count 1469 transition count 2406
Iterating global reduction 7 with 1 rules applied. Total rules applied 916 place count 1469 transition count 2406
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 917 place count 1468 transition count 2398
Iterating global reduction 7 with 1 rules applied. Total rules applied 918 place count 1468 transition count 2398
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 919 place count 1467 transition count 2390
Iterating global reduction 7 with 1 rules applied. Total rules applied 920 place count 1467 transition count 2390
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 921 place count 1466 transition count 2382
Iterating global reduction 7 with 1 rules applied. Total rules applied 922 place count 1466 transition count 2382
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 923 place count 1465 transition count 2374
Iterating global reduction 7 with 1 rules applied. Total rules applied 924 place count 1465 transition count 2374
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 925 place count 1464 transition count 2366
Iterating global reduction 7 with 1 rules applied. Total rules applied 926 place count 1464 transition count 2366
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 927 place count 1463 transition count 2358
Iterating global reduction 7 with 1 rules applied. Total rules applied 928 place count 1463 transition count 2358
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 929 place count 1462 transition count 2350
Iterating global reduction 7 with 1 rules applied. Total rules applied 930 place count 1462 transition count 2350
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 931 place count 1461 transition count 2342
Iterating global reduction 7 with 1 rules applied. Total rules applied 932 place count 1461 transition count 2342
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 933 place count 1460 transition count 2334
Iterating global reduction 7 with 1 rules applied. Total rules applied 934 place count 1460 transition count 2334
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 935 place count 1459 transition count 2326
Iterating global reduction 7 with 1 rules applied. Total rules applied 936 place count 1459 transition count 2326
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 937 place count 1458 transition count 2318
Iterating global reduction 7 with 1 rules applied. Total rules applied 938 place count 1458 transition count 2318
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 7 with 126 rules applied. Total rules applied 1064 place count 1395 transition count 2255
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1072 place count 1395 transition count 2247
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1080 place count 1387 transition count 2247
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1090 place count 1387 transition count 2247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1091 place count 1386 transition count 2246
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 1108 place count 1369 transition count 2246
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 33 Pre rules applied. Total rules applied 1108 place count 1369 transition count 2213
Deduced a syphon composed of 33 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 67 rules applied. Total rules applied 1175 place count 1335 transition count 2213
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 9 with 10 rules applied. Total rules applied 1185 place count 1325 transition count 2213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1185 place count 1325 transition count 2212
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1187 place count 1324 transition count 2212
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1205 place count 1315 transition count 2203
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1213 place count 1307 transition count 2195
Iterating global reduction 10 with 8 rules applied. Total rules applied 1221 place count 1307 transition count 2195
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 1230 place count 1307 transition count 2186
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 1239 place count 1298 transition count 2186
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 11 with 9 rules applied. Total rules applied 1248 place count 1298 transition count 2186
Applied a total of 1248 rules in 2224 ms. Remains 1298 /1991 variables (removed 693) and now considering 2186/2888 (removed 702) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2250 ms. Remains : 1298/1991 places, 2186/2888 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15472736534288223145.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5720533345911244869.kers'
[2026-05-22 21:37:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15472736534288223145.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5720533345911244869.kers]
Culling duplicate invariants (modulo rational): removing 21 columns.
Culled 21 columns in 1 ms.
// Phase 1: matrix 2186 rows 1277 cols 8562 entries
Finished phase 1 with 361 SingleSign rule and 711 generalized
[2026-05-22 21:37:18] [INFO ] Computed 226 invariants in 22 ms
Computed 226 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-5720533345911244869.kers
Total runtime 26 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (9650 resets) in 4353 ms. (229 steps per ms)
BEST_FIRST walk for 7000007 steps (7429 resets) in 12056 ms. (580 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 21:37:35] [INFO ] Invariant cache hit.
[2026-05-22 21:37:35] [INFO ] [Real]Absence check using 82 positive place invariants in 21 ms returned sat
[2026-05-22 21:37:35] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 68 ms returned sat
[2026-05-22 21:37:36] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2026-05-22 21:37:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:37:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 31 ms returned sat
[2026-05-22 21:37:36] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 38 ms returned sat
[2026-05-22 21:37:37] [INFO ] [Nat]Absence check using state equation in 799 ms returned sat
[2026-05-22 21:37:37] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 117 ms.
[2026-05-22 21:37:57] [INFO ] Added : 685 causal constraints over 137 iterations in 19795 ms. Result :sat
Minimization took 1711 ms.
[2026-05-22 21:37:59] [INFO ] [Real]Absence check using 82 positive place invariants in 25 ms returned sat
[2026-05-22 21:37:59] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 85 ms returned sat
[2026-05-22 21:38:00] [INFO ] [Real]Absence check using state equation in 869 ms returned sat
[2026-05-22 21:38:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:38:00] [INFO ] [Nat]Absence check using 82 positive place invariants in 22 ms returned sat
[2026-05-22 21:38:00] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 53 ms returned sat
[2026-05-22 21:38:01] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2026-05-22 21:38:01] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 151 ms.
[2026-05-22 21:38:21] [INFO ] Added : 625 causal constraints over 125 iterations in 19708 ms. Result :sat
Minimization took 1434 ms.
[2026-05-22 21:38:22] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2026-05-22 21:38:23] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 75 ms returned sat
[2026-05-22 21:38:23] [INFO ] [Real]Absence check using state equation in 655 ms returned sat
[2026-05-22 21:38:23] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:38:23] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2026-05-22 21:38:24] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 66 ms returned sat
[2026-05-22 21:38:24] [INFO ] [Nat]Absence check using state equation in 789 ms returned sat
[2026-05-22 21:38:25] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 128 ms.
[2026-05-22 21:38:43] [INFO ] Added : 621 causal constraints over 125 iterations in 18062 ms. Result :sat
Minimization took 1539 ms.
[2026-05-22 21:38:44] [INFO ] [Real]Absence check using 82 positive place invariants in 22 ms returned sat
[2026-05-22 21:38:44] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 53 ms returned sat
[2026-05-22 21:38:45] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2026-05-22 21:38:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:38:45] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2026-05-22 21:38:46] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 66 ms returned sat
[2026-05-22 21:38:46] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2026-05-22 21:38:47] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 137 ms.
[2026-05-22 21:39:07] [INFO ] Added : 615 causal constraints over 123 iterations in 20128 ms.(timeout) Result :sat
Minimization took 1457 ms.
[2026-05-22 21:39:08] [INFO ] [Real]Absence check using 82 positive place invariants in 23 ms returned sat
[2026-05-22 21:39:08] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 55 ms returned sat
[2026-05-22 21:39:09] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2026-05-22 21:39:09] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:39:09] [INFO ] [Nat]Absence check using 82 positive place invariants in 32 ms returned sat
[2026-05-22 21:39:10] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 67 ms returned sat
[2026-05-22 21:39:10] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2026-05-22 21:39:10] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 109 ms.
[2026-05-22 21:39:30] [INFO ] Added : 675 causal constraints over 135 iterations in 20071 ms.(timeout) Result :sat
Minimization took 1709 ms.
[2026-05-22 21:39:32] [INFO ] [Real]Absence check using 82 positive place invariants in 39 ms returned sat
[2026-05-22 21:39:32] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 58 ms returned sat
[2026-05-22 21:39:33] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2026-05-22 21:39:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:39:34] [INFO ] [Nat]Absence check using 82 positive place invariants in 28 ms returned sat
[2026-05-22 21:39:34] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 37 ms returned sat
[2026-05-22 21:39:35] [INFO ] [Nat]Absence check using state equation in 917 ms returned sat
[2026-05-22 21:39:35] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 235 ms.
[2026-05-22 21:39:41] [INFO ] Added : 149 causal constraints over 30 iterations in 6527 ms. Result :sat
Minimization took 1456 ms.
[2026-05-22 21:39:43] [INFO ] [Real]Absence check using 82 positive place invariants in 30 ms returned sat
[2026-05-22 21:39:43] [INFO ] [Real]Absence check using 82 positive and 144 generalized place invariants in 43 ms returned sat
[2026-05-22 21:39:44] [INFO ] [Real]Absence check using state equation in 957 ms returned sat
[2026-05-22 21:39:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:39:44] [INFO ] [Nat]Absence check using 82 positive place invariants in 26 ms returned sat
[2026-05-22 21:39:44] [INFO ] [Nat]Absence check using 82 positive and 144 generalized place invariants in 38 ms returned sat
[2026-05-22 21:39:45] [INFO ] [Nat]Absence check using state equation in 862 ms returned sat
[2026-05-22 21:39:46] [INFO ] Computed and/alt/rep : 874/3286/874 causal constraints (skipped 1267 transitions) in 113 ms.
[2026-05-22 21:40:05] [INFO ] Added : 630 causal constraints over 126 iterations in 20096 ms.(timeout) Result :sat
Minimization took 1622 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 1298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1298/1298 places, 2186/2186 transitions.
Applied a total of 0 rules in 57 ms. Remains 1298 /1298 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 1298/1298 places, 2186/2186 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1298/1298 places, 2186/2186 transitions.
Applied a total of 0 rules in 56 ms. Remains 1298 /1298 variables (removed 0) and now considering 2186/2186 (removed 0) transitions.
[2026-05-22 21:40:18] [INFO ] Invariant cache hit.
[2026-05-22 21:40:19] [INFO ] Implicit Places using invariants in 1577 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 626, 630, 631, 642, 643, 644, 662, 680, 717, 751, 755, 756, 767, 768, 769, 787, 805, 874, 878, 879, 890, 891, 892, 910, 928, 1004, 1018, 1019, 1020, 1038, 1056, 1125, 1129, 1130, 1133, 1144, 1145, 1146, 1164, 1166, 1169, 1187, 1188, 1189, 1190, 1202, 1208, 1214, 1220, 1226, 1232, 1238, 1244, 1250, 1256, 1262]
[2026-05-22 21:40:19] [INFO ] Actually due to overlaps returned [1164, 1146, 519, 30, 48, 150, 168, 273, 291, 396, 414, 537, 644, 662, 769, 787, 892, 910, 1020, 1038, 1169, 149, 272, 395, 518, 643, 768, 891, 1019, 1145, 1188, 148, 271, 394, 517, 642, 767, 890, 1018, 1144, 1166, 1187, 0, 259, 260, 382, 383, 505, 506, 630, 631, 755, 756, 878, 879, 1004, 1129, 1130, 18, 19, 66, 186, 309, 432, 555, 680, 805, 928, 1056, 1190, 1232, 1250, 1262, 1133, 1189, 1202, 1208, 1214, 1220, 1226, 1238, 1244, 1256]
Discarding 83 places :
Implicit Place search using SMT only with invariants took 1584 ms to find 83 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1215/1298 places, 2186/2186 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 169 rules applied. Total rules applied 169 place count 1206 transition count 2026
Reduce places removed 160 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 162 rules applied. Total rules applied 331 place count 1046 transition count 2024
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 333 place count 1044 transition count 2024
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 333 place count 1044 transition count 1982
Deduced a syphon composed of 42 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 418 place count 1001 transition count 1982
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 430 place count 997 transition count 1974
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 438 place count 989 transition count 1974
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 454 place count 973 transition count 1958
Iterating global reduction 5 with 16 rules applied. Total rules applied 470 place count 973 transition count 1958
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 474 place count 973 transition count 1954
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 474 place count 973 transition count 1953
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 476 place count 972 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 479 place count 969 transition count 1950
Iterating global reduction 6 with 3 rules applied. Total rules applied 482 place count 969 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 483 place count 968 transition count 1949
Iterating global reduction 6 with 1 rules applied. Total rules applied 484 place count 968 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 485 place count 967 transition count 1948
Iterating global reduction 6 with 1 rules applied. Total rules applied 486 place count 967 transition count 1948
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 634 place count 893 transition count 1874
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 640 place count 893 transition count 1868
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 646 place count 887 transition count 1862
Iterating global reduction 7 with 6 rules applied. Total rules applied 652 place count 887 transition count 1862
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 658 place count 887 transition count 1856
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 659 place count 887 transition count 1855
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 682 place count 887 transition count 1832
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 706 place count 863 transition count 1832
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 708 place count 863 transition count 1830
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 9 with 28 rules applied. Total rules applied 736 place count 863 transition count 1830
Applied a total of 736 rules in 518 ms. Remains 863 /1215 variables (removed 352) and now considering 1830/2186 (removed 356) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6025035433251678423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4404812544608358186.kers'
[2026-05-22 21:40:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6025035433251678423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4404812544608358186.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 1830 rows 861 cols 7511 entries
Finished phase 1 with 302 SingleSign rule and 433 generalized
[2026-05-22 21:40:20] [INFO ] Computed 128 invariants in 14 ms
Computed 128 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-4404812544608358186.kers
Total runtime 17 ms.
[2026-05-22 21:40:21] [INFO ] Implicit Places using invariants in 789 ms returned [72, 89, 95, 98, 100, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 261, 267, 270, 272, 279, 280, 332, 349, 355, 358, 360, 365, 366, 418, 435, 441, 444, 446, 452, 453, 505, 524, 530, 533, 535, 540, 541, 593, 610, 616, 619, 621, 626, 627, 696, 702, 705, 707, 711, 718, 719, 772, 789, 795, 798, 800]
[2026-05-22 21:40:21] [INFO ] Actually due to overlaps returned [104, 190, 279, 365, 452, 540, 626, 718, 105, 191, 280, 366, 453, 541, 627, 719, 89, 95, 100, 101, 174, 180, 185, 261, 267, 272, 349, 355, 360, 435, 441, 446, 524, 530, 535, 610, 616, 621, 696, 702, 707, 789, 795, 800, 72, 157, 332, 418, 505, 593, 711, 772]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 805 ms to find 52 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 811/1298 places, 1830/2186 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 774 transition count 1793
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 774 transition count 1793
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 83 place count 765 transition count 1784
Iterating global reduction 0 with 9 rules applied. Total rules applied 92 place count 765 transition count 1784
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 124 place count 749 transition count 1768
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 151 place count 749 transition count 1741
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 178 place count 722 transition count 1741
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 185 place count 722 transition count 1734
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 192 place count 715 transition count 1734
Applied a total of 192 rules in 169 ms. Remains 715 /811 variables (removed 96) and now considering 1734/1830 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-519805421355659854.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11420410381512559813.kers'
[2026-05-22 21:40:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-519805421355659854.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11420410381512559813.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 1734 rows 714 cols 7066 entries
Finished phase 1 with 249 SingleSign rule and 390 generalized
[2026-05-22 21:40:21] [INFO ] Computed 76 invariants in 13 ms
Computed 76 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-11420410381512559813.kers
Total runtime 15 ms.
[2026-05-22 21:40:21] [INFO ] Implicit Places using invariants in 620 ms returned []
[2026-05-22 21:40:21] [INFO ] Invariant cache hit.
[2026-05-22 21:40:24] [INFO ] Implicit Places using invariants and state equation in 2153 ms returned []
Implicit Place search using SMT with State Equation took 2789 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 715/1298 places, 1734/2186 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5927 ms. Remains : 715/1298 places, 1734/2186 transitions.
[2026-05-22 21:40:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (15932 resets) in 2555 ms. (391 steps per ms)
FORMULA ASLink-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 6000004 steps (14474 resets) in 5465 ms. (1097 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-22 21:40:32] [INFO ] Invariant cache hit.
[2026-05-22 21:40:32] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2026-05-22 21:40:32] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 10 ms returned sat
[2026-05-22 21:40:32] [INFO ] [Real]Absence check using state equation in 514 ms returned sat
[2026-05-22 21:40:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:40:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2026-05-22 21:40:32] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 13 ms returned sat
[2026-05-22 21:40:33] [INFO ] [Nat]Absence check using state equation in 630 ms returned sat
[2026-05-22 21:40:33] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 123 ms.
[2026-05-22 21:40:34] [INFO ] Added : 53 causal constraints over 11 iterations in 1283 ms. Result :sat
Minimization took 2330 ms.
[2026-05-22 21:40:37] [INFO ] [Real]Absence check using 33 positive place invariants in 20 ms returned sat
[2026-05-22 21:40:37] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 15 ms returned sat
[2026-05-22 21:40:38] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2026-05-22 21:40:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:40:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2026-05-22 21:40:38] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 12 ms returned sat
[2026-05-22 21:40:38] [INFO ] [Nat]Absence check using state equation in 527 ms returned sat
[2026-05-22 21:40:39] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 127 ms.
[2026-05-22 21:40:40] [INFO ] Added : 62 causal constraints over 13 iterations in 1459 ms. Result :sat
Minimization took 2180 ms.
[2026-05-22 21:40:42] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2026-05-22 21:40:42] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 18 ms returned sat
[2026-05-22 21:40:43] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2026-05-22 21:40:43] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 114 ms.
[2026-05-22 21:40:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:40:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 22 ms returned sat
[2026-05-22 21:40:44] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 24 ms returned sat
[2026-05-22 21:40:44] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2026-05-22 21:40:44] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 96 ms.
[2026-05-22 21:40:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 382 ms
[2026-05-22 21:40:49] [INFO ] Added : 141 causal constraints over 29 iterations in 4368 ms. Result :sat
Minimization took 2174 ms.
[2026-05-22 21:40:51] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2026-05-22 21:40:51] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 16 ms returned sat
[2026-05-22 21:40:52] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2026-05-22 21:40:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:40:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2026-05-22 21:40:52] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 24 ms returned sat
[2026-05-22 21:40:52] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2026-05-22 21:40:52] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 81 ms.
[2026-05-22 21:40:53] [INFO ] Added : 15 causal constraints over 3 iterations in 507 ms. Result :sat
Minimization took 1938 ms.
[2026-05-22 21:40:55] [INFO ] [Real]Absence check using 33 positive place invariants in 24 ms returned sat
[2026-05-22 21:40:55] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 16 ms returned sat
[2026-05-22 21:40:56] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2026-05-22 21:40:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:40:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2026-05-22 21:40:56] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 11 ms returned sat
[2026-05-22 21:40:56] [INFO ] [Nat]Absence check using state equation in 452 ms returned sat
[2026-05-22 21:40:56] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 117 ms.
[2026-05-22 21:40:59] [INFO ] Added : 96 causal constraints over 20 iterations in 2866 ms. Result :sat
Minimization took 2046 ms.
[2026-05-22 21:41:01] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2026-05-22 21:41:02] [INFO ] [Real]Absence check using 33 positive and 43 generalized place invariants in 23 ms returned sat
[2026-05-22 21:41:02] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2026-05-22 21:41:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 29 ms returned sat
[2026-05-22 21:41:02] [INFO ] [Nat]Absence check using 33 positive and 43 generalized place invariants in 48 ms returned sat
[2026-05-22 21:41:03] [INFO ] [Nat]Absence check using state equation in 621 ms returned sat
[2026-05-22 21:41:03] [INFO ] Computed and/alt/rep : 404/1739/404 causal constraints (skipped 1288 transitions) in 95 ms.
[2026-05-22 21:41:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2026-05-22 21:41:06] [INFO ] Added : 95 causal constraints over 19 iterations in 2918 ms. Result :sat
Minimization took 2096 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
FORMULA ASLink-PT-09a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 1734/1734 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 715 transition count 1733
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 713 transition count 1733
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 713 transition count 1732
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 712 transition count 1732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 6 place count 711 transition count 1731
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 711 transition count 1731
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 711 transition count 1730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 710 transition count 1729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 710 transition count 1728
Applied a total of 11 rules in 88 ms. Remains 710 /715 variables (removed 5) and now considering 1728/1734 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 710/715 places, 1728/1734 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4176274557392143574.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2277307564569803500.kers'
[2026-05-22 21:41:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4176274557392143574.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2277307564569803500.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1728 rows 709 cols 7019 entries
Finished phase 1 with 246 SingleSign rule and 389 generalized
[2026-05-22 21:41:11] [INFO ] Computed 75 invariants in 40 ms
Computed 75 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-2277307564569803500.kers
Total runtime 46 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16573 resets) in 2464 ms. (405 steps per ms)
BEST_FIRST walk for 5000005 steps (12673 resets) in 4395 ms. (1137 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-22 21:41:17] [INFO ] Invariant cache hit.
[2026-05-22 21:41:18] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-22 21:41:18] [INFO ] [Real]Absence check using 35 positive and 40 generalized place invariants in 11 ms returned sat
[2026-05-22 21:41:18] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2026-05-22 21:41:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-22 21:41:18] [INFO ] [Nat]Absence check using 35 positive and 40 generalized place invariants in 13 ms returned sat
[2026-05-22 21:41:19] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2026-05-22 21:41:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2026-05-22 21:41:19] [INFO ] Computed and/alt/rep : 398/1797/398 causal constraints (skipped 1288 transitions) in 84 ms.
[2026-05-22 21:41:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2026-05-22 21:41:21] [INFO ] Added : 72 causal constraints over 15 iterations in 1862 ms. Result :sat
Minimization took 2128 ms.
[2026-05-22 21:41:23] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-22 21:41:23] [INFO ] [Real]Absence check using 35 positive and 40 generalized place invariants in 8 ms returned sat
[2026-05-22 21:41:24] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2026-05-22 21:41:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-22 21:41:24] [INFO ] [Nat]Absence check using 35 positive and 40 generalized place invariants in 21 ms returned sat
[2026-05-22 21:41:25] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2026-05-22 21:41:25] [INFO ] Computed and/alt/rep : 398/1797/398 causal constraints (skipped 1288 transitions) in 100 ms.
[2026-05-22 21:41:27] [INFO ] Added : 136 causal constraints over 28 iterations in 2577 ms. Result :sat
Minimization took 2065 ms.
[2026-05-22 21:41:29] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-22 21:41:29] [INFO ] [Real]Absence check using 35 positive and 40 generalized place invariants in 8 ms returned sat
[2026-05-22 21:41:30] [INFO ] [Real]Absence check using state equation in 501 ms returned sat
[2026-05-22 21:41:30] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-22 21:41:30] [INFO ] [Nat]Absence check using 35 positive and 40 generalized place invariants in 7 ms returned sat
[2026-05-22 21:41:31] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2026-05-22 21:41:31] [INFO ] Computed and/alt/rep : 398/1797/398 causal constraints (skipped 1288 transitions) in 75 ms.
[2026-05-22 21:41:32] [INFO ] Added : 95 causal constraints over 19 iterations in 1641 ms. Result :sat
Minimization took 1964 ms.
[2026-05-22 21:41:34] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-22 21:41:34] [INFO ] [Real]Absence check using 35 positive and 40 generalized place invariants in 14 ms returned sat
[2026-05-22 21:41:35] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2026-05-22 21:41:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-22 21:41:35] [INFO ] [Nat]Absence check using 35 positive and 40 generalized place invariants in 11 ms returned sat
[2026-05-22 21:41:36] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2026-05-22 21:41:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 251 ms
[2026-05-22 21:41:36] [INFO ] Computed and/alt/rep : 398/1797/398 causal constraints (skipped 1288 transitions) in 80 ms.
[2026-05-22 21:41:37] [INFO ] Added : 93 causal constraints over 19 iterations in 1349 ms. Result :sat
Minimization took 1944 ms.
[2026-05-22 21:41:39] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-22 21:41:39] [INFO ] [Real]Absence check using 35 positive and 40 generalized place invariants in 9 ms returned sat
[2026-05-22 21:41:40] [INFO ] [Real]Absence check using state equation in 573 ms returned sat
[2026-05-22 21:41:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 26 ms returned sat
[2026-05-22 21:41:40] [INFO ] [Nat]Absence check using 35 positive and 40 generalized place invariants in 10 ms returned sat
[2026-05-22 21:41:41] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2026-05-22 21:41:41] [INFO ] Computed and/alt/rep : 398/1797/398 causal constraints (skipped 1288 transitions) in 71 ms.
[2026-05-22 21:41:42] [INFO ] Added : 47 causal constraints over 10 iterations in 812 ms. Result :sat
Minimization took 2070 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 710 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1728/1728 transitions.
Applied a total of 0 rules in 32 ms. Remains 710 /710 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 710/710 places, 1728/1728 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 710/710 places, 1728/1728 transitions.
Applied a total of 0 rules in 31 ms. Remains 710 /710 variables (removed 0) and now considering 1728/1728 (removed 0) transitions.
[2026-05-22 21:41:46] [INFO ] Invariant cache hit.
[2026-05-22 21:41:46] [INFO ] Implicit Places using invariants in 601 ms returned [208, 561, 578]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 605 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 707/710 places, 1728/1728 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 705 transition count 1726
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 705 transition count 1724
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 703 transition count 1724
Applied a total of 8 rules in 90 ms. Remains 703 /707 variables (removed 4) and now considering 1724/1728 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14321179691567590466.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4142072281125835839.kers'
[2026-05-22 21:41:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14321179691567590466.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4142072281125835839.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1724 rows 703 cols 7035 entries
Finished phase 1 with 244 SingleSign rule and 387 generalized
[2026-05-22 21:41:46] [INFO ] Computed 72 invariants in 13 ms
Computed 72 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-4142072281125835839.kers
Total runtime 15 ms.
[2026-05-22 21:41:47] [INFO ] Implicit Places using invariants in 666 ms returned []
[2026-05-22 21:41:47] [INFO ] Invariant cache hit.
[2026-05-22 21:41:49] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 2226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 703/710 places, 1724/1728 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2953 ms. Remains : 703/710 places, 1724/1728 transitions.
[2026-05-22 21:41:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (16560 resets) in 2371 ms. (421 steps per ms)
BEST_FIRST walk for 5000005 steps (12662 resets) in 4354 ms. (1148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-22 21:41:55] [INFO ] Invariant cache hit.
[2026-05-22 21:41:55] [INFO ] [Real]Absence check using 38 positive place invariants in 28 ms returned sat
[2026-05-22 21:41:55] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 12 ms returned sat
[2026-05-22 21:41:56] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2026-05-22 21:41:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:41:56] [INFO ] [Nat]Absence check using 38 positive place invariants in 15 ms returned sat
[2026-05-22 21:41:56] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 7 ms returned sat
[2026-05-22 21:41:57] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2026-05-22 21:41:57] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 115 ms.
[2026-05-22 21:41:58] [INFO ] Added : 55 causal constraints over 11 iterations in 1326 ms. Result :sat
Minimization took 1231 ms.
[2026-05-22 21:42:00] [INFO ] [Real]Absence check using 38 positive place invariants in 14 ms returned sat
[2026-05-22 21:42:00] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 8 ms returned sat
[2026-05-22 21:42:00] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2026-05-22 21:42:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:00] [INFO ] [Nat]Absence check using 38 positive place invariants in 22 ms returned sat
[2026-05-22 21:42:00] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 12 ms returned sat
[2026-05-22 21:42:01] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2026-05-22 21:42:01] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 77 ms.
[2026-05-22 21:42:02] [INFO ] Added : 63 causal constraints over 13 iterations in 1385 ms. Result :sat
Minimization took 1190 ms.
[2026-05-22 21:42:04] [INFO ] [Real]Absence check using 38 positive place invariants in 25 ms returned sat
[2026-05-22 21:42:04] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 19 ms returned sat
[2026-05-22 21:42:04] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2026-05-22 21:42:04] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:04] [INFO ] [Nat]Absence check using 38 positive place invariants in 13 ms returned sat
[2026-05-22 21:42:05] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 44 ms returned sat
[2026-05-22 21:42:05] [INFO ] [Nat]Absence check using state equation in 489 ms returned sat
[2026-05-22 21:42:05] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 112 ms.
[2026-05-22 21:42:08] [INFO ] Added : 134 causal constraints over 27 iterations in 2833 ms. Result :sat
Minimization took 1355 ms.
[2026-05-22 21:42:09] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2026-05-22 21:42:09] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 7 ms returned sat
[2026-05-22 21:42:10] [INFO ] [Real]Absence check using state equation in 552 ms returned sat
[2026-05-22 21:42:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:10] [INFO ] [Nat]Absence check using 38 positive place invariants in 16 ms returned sat
[2026-05-22 21:42:10] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 10 ms returned sat
[2026-05-22 21:42:11] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2026-05-22 21:42:11] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 81 ms.
[2026-05-22 21:42:12] [INFO ] Added : 74 causal constraints over 15 iterations in 1474 ms. Result :sat
Minimization took 1331 ms.
[2026-05-22 21:42:14] [INFO ] [Real]Absence check using 38 positive place invariants in 13 ms returned sat
[2026-05-22 21:42:14] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 9 ms returned sat
[2026-05-22 21:42:14] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2026-05-22 21:42:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:14] [INFO ] [Nat]Absence check using 38 positive place invariants in 18 ms returned sat
[2026-05-22 21:42:14] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 9 ms returned sat
[2026-05-22 21:42:15] [INFO ] [Nat]Absence check using state equation in 575 ms returned sat
[2026-05-22 21:42:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2026-05-22 21:42:15] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 82 ms.
[2026-05-22 21:42:17] [INFO ] Added : 98 causal constraints over 20 iterations in 1618 ms. Result :sat
Minimization took 1505 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA ASLink-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1724/1724 transitions.
Applied a total of 0 rules in 31 ms. Remains 703 /703 variables (removed 0) and now considering 1724/1724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 703/703 places, 1724/1724 transitions.
[2026-05-22 21:42:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (16503 resets) in 2394 ms. (417 steps per ms)
BEST_FIRST walk for 4000004 steps (10165 resets) in 3431 ms. (1165 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-22 21:42:26] [INFO ] Invariant cache hit.
[2026-05-22 21:42:26] [INFO ] [Real]Absence check using 38 positive place invariants in 13 ms returned sat
[2026-05-22 21:42:26] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 7 ms returned sat
[2026-05-22 21:42:27] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2026-05-22 21:42:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:27] [INFO ] [Nat]Absence check using 38 positive place invariants in 13 ms returned sat
[2026-05-22 21:42:27] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 9 ms returned sat
[2026-05-22 21:42:27] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2026-05-22 21:42:28] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 71 ms.
[2026-05-22 21:42:29] [INFO ] Added : 55 causal constraints over 11 iterations in 1118 ms. Result :sat
Minimization took 1221 ms.
[2026-05-22 21:42:30] [INFO ] [Real]Absence check using 38 positive place invariants in 39 ms returned sat
[2026-05-22 21:42:30] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 10 ms returned sat
[2026-05-22 21:42:31] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2026-05-22 21:42:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:31] [INFO ] [Nat]Absence check using 38 positive place invariants in 13 ms returned sat
[2026-05-22 21:42:31] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 10 ms returned sat
[2026-05-22 21:42:31] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2026-05-22 21:42:31] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 97 ms.
[2026-05-22 21:42:33] [INFO ] Added : 63 causal constraints over 13 iterations in 1715 ms. Result :sat
Minimization took 1230 ms.
[2026-05-22 21:42:34] [INFO ] [Real]Absence check using 38 positive place invariants in 19 ms returned sat
[2026-05-22 21:42:34] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 11 ms returned sat
[2026-05-22 21:42:35] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2026-05-22 21:42:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:35] [INFO ] [Nat]Absence check using 38 positive place invariants in 29 ms returned sat
[2026-05-22 21:42:35] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 22 ms returned sat
[2026-05-22 21:42:36] [INFO ] [Nat]Absence check using state equation in 437 ms returned sat
[2026-05-22 21:42:36] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 77 ms.
[2026-05-22 21:42:39] [INFO ] Added : 134 causal constraints over 27 iterations in 3559 ms. Result :sat
Minimization took 1288 ms.
[2026-05-22 21:42:41] [INFO ] [Real]Absence check using 38 positive place invariants in 12 ms returned sat
[2026-05-22 21:42:41] [INFO ] [Real]Absence check using 38 positive and 34 generalized place invariants in 10 ms returned sat
[2026-05-22 21:42:41] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2026-05-22 21:42:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:42:41] [INFO ] [Nat]Absence check using 38 positive place invariants in 26 ms returned sat
[2026-05-22 21:42:41] [INFO ] [Nat]Absence check using 38 positive and 34 generalized place invariants in 22 ms returned sat
[2026-05-22 21:42:42] [INFO ] [Nat]Absence check using state equation in 514 ms returned sat
[2026-05-22 21:42:42] [INFO ] Computed and/alt/rep : 396/1683/396 causal constraints (skipped 1286 transitions) in 79 ms.
[2026-05-22 21:42:43] [INFO ] Added : 74 causal constraints over 15 iterations in 1411 ms. Result :sat
Minimization took 1371 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1724/1724 transitions.
Applied a total of 0 rules in 27 ms. Remains 703 /703 variables (removed 0) and now considering 1724/1724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 703/703 places, 1724/1724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1724/1724 transitions.
Applied a total of 0 rules in 26 ms. Remains 703 /703 variables (removed 0) and now considering 1724/1724 (removed 0) transitions.
[2026-05-22 21:42:46] [INFO ] Invariant cache hit.
[2026-05-22 21:42:47] [INFO ] Implicit Places using invariants in 516 ms returned []
[2026-05-22 21:42:47] [INFO ] Invariant cache hit.
[2026-05-22 21:42:49] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2183 ms to find 0 implicit places.
[2026-05-22 21:42:49] [INFO ] Redundant transitions in 113 ms returned []
Running 1682 sub problems to find dead transitions.
[2026-05-22 21:42:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 702/2427 variables, and 70 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 36/38 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/702 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/702 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 702/2427 variables, and 70 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 36/38 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 0/703 constraints, PredecessorRefiner: 0/1682 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60866ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 60886ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63244 ms. Remains : 703/703 places, 1724/1724 transitions.
RANDOM walk for 40000 steps (654 resets) in 1041 ms. (38 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (101 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (102 resets) in 200 ms. (199 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (100 resets) in 188 ms. (211 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (96 resets) in 139 ms. (285 steps per ms) remains 8/8 properties
[2026-05-22 21:43:50] [INFO ] Flatten gal took : 248 ms
BEST_FIRST walk for 40003 steps (103 resets) in 174 ms. (228 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (103 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (92 resets) in 171 ms. (232 steps per ms) remains 8/8 properties
[2026-05-22 21:43:50] [INFO ] Flatten gal took : 153 ms
[2026-05-22 21:43:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1082509940612602959.gal : 45 ms
[2026-05-22 21:43:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17504004453631557942.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/ReachabilityCardinality1082509940612602959.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17504004453631557942.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/ReachabilityCardinality17504004453631557942.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :6 after 44
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :18272 after 1.51967e+07
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1.51967e+07 after 4.66253e+08
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :4.66253e+08 after 4.78828e+08
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4.78828e+08 after 4.78926e+08
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :4.78926e+08 after 5.0914e+08
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :5.0914e+08 after 1.69926e+10
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :1.69926e+10 after 1.70276e+10
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1.70276e+10 after 2.34014e+12
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.13532e+13,2.82603,87060,2,55809,23,189052,6,0,4540,205186,0
Total reachable state count : 21353226179616

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,44,2.83262,87060,2,1061,23,189052,7,0,4543,205186,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,44,2.83667,87060,2,1061,23,189052,8,0,4544,205186,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,44,2.84171,87060,2,1061,23,189052,9,0,4546,205186,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,44,2.84671,87060,2,1061,23,189052,10,0,4547,205186,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,49864,2.84881,87060,2,5195,23,189052,11,0,4549,205186,0
Invariant property MIN2 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
MIN2,49864,2.85047,87060,2,5195,23,189052,12,0,4550,205186,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,18272,2.85271,87060,2,1755,23,189052,13,0,4552,205186,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,18272,2.85471,87060,2,1755,23,189052,14,0,4553,205186,0
ITS tools runner thread asked to quit. Dying gracefully.
Interrupted probabilistic random walk after 113074 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 8
Probabilistic random walk after 113074 steps, saw 67191 distinct states, run finished after 3006 ms. (steps per millisecond=37 ) properties seen :0
FORMULA ASLink-PT-09a-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-09a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-09a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA ASLink-PT-09a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 21:43:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (16524 resets) in 2432 ms. (411 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 458870 ms.

BK_STOP 1779486236392

--------------------
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="ASLink-PT-09a"
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 ASLink-PT-09a, 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 r002-oct2-177944366300413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09a.tgz
mv ASLink-PT-09a 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 ;