About the Execution of ITS-Tools for ASLink-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1627.411 | 290348.00 | 354177.00 | 210.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200405.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-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200405
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.4K Mar 5 14:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K 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 59K 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.6K Mar 15 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 5 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Mar 5 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 5 14:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Mar 5 14:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:10 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 1.2M 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-08b-UpperBounds-00
FORMULA_NAME ASLink-PT-08b-UpperBounds-01
FORMULA_NAME ASLink-PT-08b-UpperBounds-02
FORMULA_NAME ASLink-PT-08b-UpperBounds-03
FORMULA_NAME ASLink-PT-08b-UpperBounds-04
FORMULA_NAME ASLink-PT-08b-UpperBounds-05
FORMULA_NAME ASLink-PT-08b-UpperBounds-06
FORMULA_NAME ASLink-PT-08b-UpperBounds-07
FORMULA_NAME ASLink-PT-08b-UpperBounds-08
FORMULA_NAME ASLink-PT-08b-UpperBounds-09
FORMULA_NAME ASLink-PT-08b-UpperBounds-10
FORMULA_NAME ASLink-PT-08b-UpperBounds-11
FORMULA_NAME ASLink-PT-08b-UpperBounds-12
FORMULA_NAME ASLink-PT-08b-UpperBounds-13
FORMULA_NAME ASLink-PT-08b-UpperBounds-14
FORMULA_NAME ASLink-PT-08b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779484465481
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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-22 21:14:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:14:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:14:27] [INFO ] Load time of PNML (sax parser for PT used): 215 ms
[2026-05-22 21:14:27] [INFO ] Transformed 3618 places.
[2026-05-22 21:14:27] [INFO ] Transformed 4459 transitions.
[2026-05-22 21:14:27] [INFO ] Found NUPN structural information;
[2026-05-22 21:14:27] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
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-2767341848532223795.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5494277189763901412.kers'
[2026-05-22 21:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2767341848532223795.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5494277189763901412.kers]
Culled 0 columns in 3 ms.
// Phase 1: matrix 4459 rows 3618 cols 13543 entries
Finished phase 1 with 2455 SingleSign rule and 808 generalized
[2026-05-22 21:14:27] [INFO ] Computed 355 invariants in 39 ms
Computed 355 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-5494277189763901412.kers
Total runtime 44 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 (13 resets) in 84 ms. (117 steps per ms)
FORMULA ASLink-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 79 ms. (625 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:14:27] [INFO ] Invariant cache hit.
[2026-05-22 21:14:28] [INFO ] [Real]Absence check using 80 positive place invariants in 116 ms returned sat
[2026-05-22 21:14:29] [INFO ] [Real]Absence check using 80 positive and 275 generalized place invariants in 211 ms returned sat
[2026-05-22 21:14:31] [INFO ] [Real]Absence check using state equation in 2723 ms returned sat
[2026-05-22 21:14:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:14:32] [INFO ] [Nat]Absence check using 80 positive place invariants in 131 ms returned sat
[2026-05-22 21:14:32] [INFO ] [Nat]Absence check using 80 positive and 275 generalized place invariants in 196 ms returned sat
[2026-05-22 21:14:35] [INFO ] [Nat]Absence check using state equation in 2345 ms returned sat
[2026-05-22 21:14:37] [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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
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:14:38] [INFO ] [Real]Absence check using 80 positive place invariants in 99 ms returned sat
[2026-05-22 21:14:38] [INFO ] [Real]Absence check using 80 positive and 275 generalized place invariants in 213 ms returned sat
[2026-05-22 21:14:42] [INFO ] [Real]Absence check using state equation in 3306 ms returned sat
[2026-05-22 21:14:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:14:43] [INFO ] [Nat]Absence check using 80 positive place invariants in 92 ms returned sat
[2026-05-22 21:14:43] [INFO ] [Nat]Absence check using 80 positive and 275 generalized place invariants in 199 ms returned sat
[2026-05-22 21:14:45] [INFO ] [Nat]Absence check using state equation in 2267 ms returned sat
[2026-05-22 21:14:47] [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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
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:14:48] [INFO ] [Real]Absence check using 80 positive place invariants in 98 ms returned sat
[2026-05-22 21:14:48] [INFO ] [Real]Absence check using 80 positive and 275 generalized place invariants in 185 ms returned sat
[2026-05-22 21:14:51] [INFO ] [Real]Absence check using state equation in 2532 ms returned sat
[2026-05-22 21:14:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:14:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 84 ms returned sat
[2026-05-22 21:14:52] [INFO ] [Nat]Absence check using 80 positive and 275 generalized place invariants in 140 ms returned sat
[2026-05-22 21:14:55] [INFO ] [Nat]Absence check using state equation in 3423 ms returned sat
[2026-05-22 21:14:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
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:14:58] [INFO ] [Real]Absence check using 80 positive place invariants in 88 ms returned sat
[2026-05-22 21:14:58] [INFO ] [Real]Absence check using 80 positive and 275 generalized place invariants in 241 ms returned sat
[2026-05-22 21:15:01] [INFO ] [Real]Absence check using state equation in 2192 ms returned sat
[2026-05-22 21:15:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:15:02] [INFO ] [Nat]Absence check using 80 positive place invariants in 88 ms returned sat
[2026-05-22 21:15:02] [INFO ] [Nat]Absence check using 80 positive and 275 generalized place invariants in 171 ms returned sat
[2026-05-22 21:15:06] [INFO ] [Nat]Absence check using state equation in 3951 ms returned sat
[2026-05-22 21:15:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:960)
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:15:07] [INFO ] [Real]Absence check using 80 positive place invariants in 83 ms returned sat
[2026-05-22 21:15:07] [INFO ] [Real]Absence check using 80 positive and 275 generalized place invariants in 257 ms returned sat
[2026-05-22 21:15:10] [INFO ] [Real]Absence check using state equation in 2720 ms returned sat
[2026-05-22 21:15:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:15:10] [INFO ] [Nat]Absence check using 80 positive place invariants in 87 ms returned sat
[2026-05-22 21:15:11] [INFO ] [Nat]Absence check using 80 positive and 275 generalized place invariants in 156 ms returned sat
[2026-05-22 21:15:15] [INFO ] [Nat]Absence check using state equation in 4099 ms returned unknown
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 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 841 transitions
Trivial Post-agglo rules discarded 841 transitions
Performed 841 trivial Post agglomeration. Transition count delta: 841
Iterating post reduction 0 with 841 rules applied. Total rules applied 841 place count 3618 transition count 3618
Reduce places removed 841 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 877 rules applied. Total rules applied 1718 place count 2777 transition count 3582
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 1728 place count 2768 transition count 3581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1729 place count 2767 transition count 3581
Performed 839 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 839 Pre rules applied. Total rules applied 1729 place count 2767 transition count 2742
Deduced a syphon composed of 839 places in 11 ms
Ensure Unique test removed 81 places
Reduce places removed 920 places and 0 transitions.
Iterating global reduction 4 with 1759 rules applied. Total rules applied 3488 place count 1847 transition count 2742
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 58 rules applied. Total rules applied 3546 place count 1839 transition count 2692
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 51 rules applied. Total rules applied 3597 place count 1789 transition count 2691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3598 place count 1788 transition count 2691
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 31 Pre rules applied. Total rules applied 3598 place count 1788 transition count 2660
Deduced a syphon composed of 31 places in 8 ms
Ensure Unique test removed 31 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 7 with 93 rules applied. Total rules applied 3691 place count 1726 transition count 2660
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 31 Pre rules applied. Total rules applied 3691 place count 1726 transition count 2629
Deduced a syphon composed of 31 places in 5 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 3753 place count 1695 transition count 2629
Discarding 116 places :
Symmetric choice reduction at 7 with 116 rule applications. Total rules 3869 place count 1579 transition count 2513
Iterating global reduction 7 with 116 rules applied. Total rules applied 3985 place count 1579 transition count 2513
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3986 place count 1579 transition count 2512
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 3986 place count 1579 transition count 2474
Deduced a syphon composed of 38 places in 20 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 77 rules applied. Total rules applied 4063 place count 1540 transition count 2474
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4063 place count 1540 transition count 2473
Deduced a syphon composed of 1 places in 16 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4066 place count 1538 transition count 2473
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4075 place count 1529 transition count 2416
Iterating global reduction 8 with 9 rules applied. Total rules applied 4084 place count 1529 transition count 2416
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 4084 place count 1529 transition count 2408
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 4100 place count 1521 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4101 place count 1520 transition count 2400
Iterating global reduction 8 with 1 rules applied. Total rules applied 4102 place count 1520 transition count 2400
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4103 place count 1519 transition count 2392
Iterating global reduction 8 with 1 rules applied. Total rules applied 4104 place count 1519 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4105 place count 1518 transition count 2384
Iterating global reduction 8 with 1 rules applied. Total rules applied 4106 place count 1518 transition count 2384
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4107 place count 1517 transition count 2376
Iterating global reduction 8 with 1 rules applied. Total rules applied 4108 place count 1517 transition count 2376
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4109 place count 1516 transition count 2368
Iterating global reduction 8 with 1 rules applied. Total rules applied 4110 place count 1516 transition count 2368
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4111 place count 1515 transition count 2360
Iterating global reduction 8 with 1 rules applied. Total rules applied 4112 place count 1515 transition count 2360
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4113 place count 1514 transition count 2352
Iterating global reduction 8 with 1 rules applied. Total rules applied 4114 place count 1514 transition count 2352
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4115 place count 1513 transition count 2344
Iterating global reduction 8 with 1 rules applied. Total rules applied 4116 place count 1513 transition count 2344
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4117 place count 1512 transition count 2336
Iterating global reduction 8 with 1 rules applied. Total rules applied 4118 place count 1512 transition count 2336
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4119 place count 1511 transition count 2328
Iterating global reduction 8 with 1 rules applied. Total rules applied 4120 place count 1511 transition count 2328
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4121 place count 1510 transition count 2320
Iterating global reduction 8 with 1 rules applied. Total rules applied 4122 place count 1510 transition count 2320
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4123 place count 1509 transition count 2312
Iterating global reduction 8 with 1 rules applied. Total rules applied 4124 place count 1509 transition count 2312
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4125 place count 1508 transition count 2304
Iterating global reduction 8 with 1 rules applied. Total rules applied 4126 place count 1508 transition count 2304
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4127 place count 1507 transition count 2296
Iterating global reduction 8 with 1 rules applied. Total rules applied 4128 place count 1507 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4129 place count 1506 transition count 2288
Iterating global reduction 8 with 1 rules applied. Total rules applied 4130 place count 1506 transition count 2288
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4131 place count 1505 transition count 2280
Iterating global reduction 8 with 1 rules applied. Total rules applied 4132 place count 1505 transition count 2280
Performed 213 Post agglomeration using F-continuation condition.Transition count delta: 213
Deduced a syphon composed of 213 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 214 places and 0 transitions.
Iterating global reduction 8 with 427 rules applied. Total rules applied 4559 place count 1291 transition count 2067
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4560 place count 1290 transition count 2066
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4562 place count 1289 transition count 2066
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4563 place count 1288 transition count 2065
Iterating global reduction 8 with 1 rules applied. Total rules applied 4564 place count 1288 transition count 2065
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 4566 place count 1288 transition count 2063
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4567 place count 1287 transition count 2063
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 4569 place count 1286 transition count 2072
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4578 place count 1286 transition count 2063
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4587 place count 1277 transition count 2063
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 4594 place count 1277 transition count 2056
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 4601 place count 1270 transition count 2056
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4602 place count 1269 transition count 2055
Reduce places removed 15 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 12 with 22 rules applied. Total rules applied 4624 place count 1254 transition count 2048
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 13 with 7 rules applied. Total rules applied 4631 place count 1247 transition count 2048
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 22 Pre rules applied. Total rules applied 4631 place count 1247 transition count 2026
Deduced a syphon composed of 22 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 14 with 45 rules applied. Total rules applied 4676 place count 1224 transition count 2026
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 14 with 8 rules applied. Total rules applied 4684 place count 1216 transition count 2026
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4684 place count 1216 transition count 2025
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4686 place count 1215 transition count 2025
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 15 with 32 rules applied. Total rules applied 4718 place count 1199 transition count 2009
Discarding 7 places :
Symmetric choice reduction at 15 with 7 rule applications. Total rules 4725 place count 1192 transition count 2002
Iterating global reduction 15 with 7 rules applied. Total rules applied 4732 place count 1192 transition count 2002
Free-agglomeration rule applied 7 times.
Iterating global reduction 15 with 7 rules applied. Total rules applied 4739 place count 1192 transition count 1995
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 4746 place count 1185 transition count 1995
Applied a total of 4746 rules in 2887 ms. Remains 1185 /3618 variables (removed 2433) and now considering 1995/4459 (removed 2464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2902 ms. Remains : 1185/3618 places, 1995/4459 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13144440952755099123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6417456089856483946.kers'
[2026-05-22 21:15:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13144440952755099123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6417456089856483946.kers]
Culling duplicate invariants (modulo rational): removing 20 columns.
Culled 20 columns in 4 ms.
// Phase 1: matrix 1995 rows 1165 cols 7813 entries
Finished phase 1 with 314 SingleSign rule and 664 generalized
[2026-05-22 21:15:18] [INFO ] Computed 207 invariants in 47 ms
Computed 207 P flows in 47 ms.
Exported basis to /tmp/petrispot-output-6417456089856483946.kers
Total runtime 49 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 (10161 resets) in 4358 ms. (229 steps per ms)
FORMULA ASLink-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (3782 resets) in 5459 ms. (549 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 21:15:28] [INFO ] Invariant cache hit.
[2026-05-22 21:15:28] [INFO ] [Real]Absence check using 82 positive place invariants in 30 ms returned sat
[2026-05-22 21:15:28] [INFO ] [Real]Absence check using 82 positive and 125 generalized place invariants in 75 ms returned sat
[2026-05-22 21:15:29] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2026-05-22 21:15:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:15:29] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2026-05-22 21:15:29] [INFO ] [Nat]Absence check using 82 positive and 125 generalized place invariants in 33 ms returned sat
[2026-05-22 21:15:30] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2026-05-22 21:15:30] [INFO ] Computed and/alt/rep : 798/3078/798 causal constraints (skipped 1155 transitions) in 154 ms.
[2026-05-22 21:15:48] [INFO ] Added : 581 causal constraints over 117 iterations in 17676 ms. Result :sat
Minimization took 1485 ms.
[2026-05-22 21:15:49] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2026-05-22 21:15:49] [INFO ] [Real]Absence check using 82 positive and 125 generalized place invariants in 26 ms returned sat
[2026-05-22 21:15:50] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2026-05-22 21:15:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:15:50] [INFO ] [Nat]Absence check using 82 positive place invariants in 24 ms returned sat
[2026-05-22 21:15:50] [INFO ] [Nat]Absence check using 82 positive and 125 generalized place invariants in 27 ms returned sat
[2026-05-22 21:15:51] [INFO ] [Nat]Absence check using state equation in 728 ms returned sat
[2026-05-22 21:15:51] [INFO ] Computed and/alt/rep : 798/3078/798 causal constraints (skipped 1155 transitions) in 116 ms.
[2026-05-22 21:15:57] [INFO ] Added : 130 causal constraints over 26 iterations in 5314 ms. Result :sat
Minimization took 2007 ms.
[2026-05-22 21:15:59] [INFO ] [Real]Absence check using 82 positive place invariants in 24 ms returned sat
[2026-05-22 21:15:59] [INFO ] [Real]Absence check using 82 positive and 125 generalized place invariants in 34 ms returned sat
[2026-05-22 21:16:00] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2026-05-22 21:16:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:16:00] [INFO ] [Nat]Absence check using 82 positive place invariants in 25 ms returned sat
[2026-05-22 21:16:00] [INFO ] [Nat]Absence check using 82 positive and 125 generalized place invariants in 33 ms returned sat
[2026-05-22 21:16:01] [INFO ] [Nat]Absence check using state equation in 811 ms returned sat
[2026-05-22 21:16:01] [INFO ] Computed and/alt/rep : 798/3078/798 causal constraints (skipped 1155 transitions) in 113 ms.
[2026-05-22 21:16:08] [INFO ] Added : 170 causal constraints over 34 iterations in 7286 ms. Result :sat
Minimization took 1411 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 1995/1995 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 1185 transition count 1994
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1184 transition count 1994
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1184 transition count 1993
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1183 transition count 1993
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 1181 transition count 1992
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 2 rules applied. Total rules applied 9 place count 1181 transition count 1990
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11 place count 1179 transition count 1990
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 11 place count 1179 transition count 1989
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 13 place count 1178 transition count 1989
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 14 place count 1177 transition count 1989
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 18 place count 1175 transition count 1987
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 19 place count 1174 transition count 1986
Iterating global reduction 5 with 1 rules applied. Total rules applied 20 place count 1174 transition count 1986
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 21 place count 1174 transition count 1985
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 22 place count 1173 transition count 1985
Applied a total of 22 rules in 213 ms. Remains 1173 /1185 variables (removed 12) and now considering 1985/1995 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 1173/1185 places, 1985/1995 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9504238396604029499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14912336955551753208.kers'
[2026-05-22 21:16:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9504238396604029499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14912336955551753208.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 1 ms.
// Phase 1: matrix 1985 rows 1154 cols 7786 entries
Finished phase 1 with 308 SingleSign rule and 661 generalized
[2026-05-22 21:16:14] [INFO ] Computed 204 invariants in 32 ms
Computed 204 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-14912336955551753208.kers
Total runtime 35 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (10332 resets) in 3826 ms. (261 steps per ms)
BEST_FIRST walk for 3000002 steps (3828 resets) in 5395 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 21:16:23] [INFO ] Invariant cache hit.
[2026-05-22 21:16:23] [INFO ] [Real]Absence check using 80 positive place invariants in 21 ms returned sat
[2026-05-22 21:16:24] [INFO ] [Real]Absence check using 80 positive and 124 generalized place invariants in 67 ms returned sat
[2026-05-22 21:16:24] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
[2026-05-22 21:16:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:16:25] [INFO ] [Nat]Absence check using 80 positive place invariants in 36 ms returned sat
[2026-05-22 21:16:25] [INFO ] [Nat]Absence check using 80 positive and 124 generalized place invariants in 42 ms returned sat
[2026-05-22 21:16:25] [INFO ] [Nat]Absence check using state equation in 756 ms returned sat
[2026-05-22 21:16:26] [INFO ] Computed and/alt/rep : 789/3056/789 causal constraints (skipped 1155 transitions) in 140 ms.
[2026-05-22 21:16:31] [INFO ] Added : 137 causal constraints over 28 iterations in 5168 ms. Result :sat
Minimization took 2212 ms.
[2026-05-22 21:16:33] [INFO ] [Real]Absence check using 80 positive place invariants in 25 ms returned sat
[2026-05-22 21:16:33] [INFO ] [Real]Absence check using 80 positive and 124 generalized place invariants in 42 ms returned sat
[2026-05-22 21:16:34] [INFO ] [Real]Absence check using state equation in 640 ms returned sat
[2026-05-22 21:16:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:16:34] [INFO ] [Nat]Absence check using 80 positive place invariants in 19 ms returned sat
[2026-05-22 21:16:34] [INFO ] [Nat]Absence check using 80 positive and 124 generalized place invariants in 28 ms returned sat
[2026-05-22 21:16:35] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2026-05-22 21:16:35] [INFO ] Computed and/alt/rep : 789/3056/789 causal constraints (skipped 1155 transitions) in 90 ms.
[2026-05-22 21:16:51] [INFO ] Added : 544 causal constraints over 109 iterations in 16247 ms. Result :sat
Minimization took 1821 ms.
[2026-05-22 21:16:53] [INFO ] [Real]Absence check using 80 positive place invariants in 29 ms returned sat
[2026-05-22 21:16:53] [INFO ] [Real]Absence check using 80 positive and 124 generalized place invariants in 69 ms returned sat
[2026-05-22 21:16:54] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2026-05-22 21:16:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:16:54] [INFO ] [Nat]Absence check using 80 positive place invariants in 22 ms returned sat
[2026-05-22 21:16:54] [INFO ] [Nat]Absence check using 80 positive and 124 generalized place invariants in 75 ms returned sat
[2026-05-22 21:16:55] [INFO ] [Nat]Absence check using state equation in 803 ms returned sat
[2026-05-22 21:16:55] [INFO ] Computed and/alt/rep : 789/3056/789 causal constraints (skipped 1155 transitions) in 151 ms.
[2026-05-22 21:17:15] [INFO ] Added : 607 causal constraints over 122 iterations in 19356 ms. Result :sat
Minimization took 2365 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1985/1985 transitions.
Applied a total of 0 rules in 43 ms. Remains 1173 /1173 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 1173/1173 places, 1985/1985 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1985/1985 transitions.
Applied a total of 0 rules in 42 ms. Remains 1173 /1173 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
[2026-05-22 21:17:21] [INFO ] Invariant cache hit.
[2026-05-22 21:17:23] [INFO ] Implicit Places using invariants in 1222 ms returned [1, 18, 19, 31, 48, 66, 141, 150, 151, 153, 170, 188, 226, 260, 264, 265, 276, 277, 279, 296, 314, 384, 388, 389, 400, 401, 403, 420, 438, 507, 511, 512, 523, 524, 526, 543, 561, 630, 634, 635, 646, 647, 649, 666, 684, 753, 757, 758, 769, 770, 772, 789, 807, 876, 880, 881, 892, 893, 895, 912, 930, 999, 1003, 1004, 1007, 1018, 1019, 1020, 1038, 1040, 1044, 1062, 1063, 1064, 1065, 1077, 1083, 1089, 1095, 1101, 1107, 1113, 1119, 1125, 1131, 1137]
[2026-05-22 21:17:23] [INFO ] Actually due to overlaps returned [1038, 1020, 48, 170, 296, 420, 543, 666, 789, 912, 1044, 31, 153, 279, 403, 526, 649, 772, 895, 150, 276, 400, 523, 646, 769, 892, 1018, 1062, 151, 277, 401, 524, 647, 770, 893, 1019, 1040, 1063, 1, 18, 264, 265, 388, 389, 511, 512, 634, 635, 757, 758, 880, 881, 1003, 1004, 66, 188, 314, 438, 561, 684, 807, 930, 1064, 1107, 1125, 1137, 19, 1007, 1065, 1077, 1083, 1089, 1095, 1101, 1113, 1119, 1131]
Discarding 77 places :
Implicit Place search using SMT only with invariants took 1226 ms to find 77 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1096/1173 places, 1985/1985 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 1088 transition count 1828
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 331 place count 931 transition count 1819
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 930 transition count 1819
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 332 place count 930 transition count 1780
Deduced a syphon composed of 39 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 79 rules applied. Total rules applied 411 place count 890 transition count 1780
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 423 place count 886 transition count 1772
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 431 place count 878 transition count 1772
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 446 place count 863 transition count 1757
Iterating global reduction 5 with 15 rules applied. Total rules applied 461 place count 863 transition count 1757
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 464 place count 863 transition count 1754
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 464 place count 863 transition count 1753
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 466 place count 862 transition count 1753
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 469 place count 859 transition count 1747
Iterating global reduction 6 with 3 rules applied. Total rules applied 472 place count 859 transition count 1747
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 473 place count 858 transition count 1746
Iterating global reduction 6 with 1 rules applied. Total rules applied 474 place count 858 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 475 place count 857 transition count 1744
Iterating global reduction 6 with 1 rules applied. Total rules applied 476 place count 857 transition count 1744
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 3 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 6 with 116 rules applied. Total rules applied 592 place count 799 transition count 1686
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 599 place count 792 transition count 1679
Iterating global reduction 6 with 7 rules applied. Total rules applied 606 place count 792 transition count 1679
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 613 place count 792 transition count 1672
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 617 place count 790 transition count 1673
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 635 place count 790 transition count 1655
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 654 place count 771 transition count 1655
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 678 place count 771 transition count 1655
Applied a total of 678 rules in 312 ms. Remains 771 /1096 variables (removed 325) and now considering 1655/1985 (removed 330) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15524579843037520685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3928450477995976734.kers'
[2026-05-22 21:17:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15524579843037520685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3928450477995976734.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 3 ms.
// Phase 1: matrix 1655 rows 770 cols 6773 entries
Finished phase 1 with 243 SingleSign rule and 415 generalized
[2026-05-22 21:17:23] [INFO ] Computed 113 invariants in 39 ms
Computed 113 P flows in 40 ms.
Exported basis to /tmp/petrispot-output-3928450477995976734.kers
Total runtime 41 ms.
[2026-05-22 21:17:24] [INFO ] Implicit Places using invariants in 799 ms returned [89, 95, 98, 100, 103, 104, 107, 108, 160, 179, 185, 188, 190, 195, 196, 249, 266, 272, 275, 277, 282, 283, 335, 352, 358, 361, 363, 368, 369, 421, 438, 444, 447, 449, 454, 455, 507, 524, 530, 533, 535, 540, 541, 593, 610, 616, 619, 621, 626, 627, 679, 696, 702, 705, 707]
[2026-05-22 21:17:24] [INFO ] Actually due to overlaps returned [107, 195, 282, 368, 454, 540, 626, 108, 196, 283, 369, 455, 541, 627, 89, 95, 100, 179, 185, 190, 266, 272, 277, 352, 358, 363, 438, 444, 449, 524, 530, 535, 610, 616, 621, 696, 702, 707, 103, 104, 160, 249, 335, 421, 507, 593, 679]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 802 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 724/1173 places, 1655/1985 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 691 transition count 1622
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 691 transition count 1622
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 74 place count 683 transition count 1614
Iterating global reduction 0 with 8 rules applied. Total rules applied 82 place count 683 transition count 1614
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 112 place count 668 transition count 1599
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 113 place count 668 transition count 1598
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 137 place count 668 transition count 1574
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 161 place count 644 transition count 1574
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 168 place count 644 transition count 1567
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 175 place count 637 transition count 1567
Applied a total of 175 rules in 169 ms. Remains 637 /724 variables (removed 87) and now considering 1567/1655 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5193234420641437183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12889755433136353780.kers'
[2026-05-22 21:17:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5193234420641437183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12889755433136353780.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1567 rows 637 cols 6382 entries
Finished phase 1 with 144 SingleSign rule and 427 generalized
[2026-05-22 21:17:24] [INFO ] Computed 66 invariants in 27 ms
Computed 66 P flows in 27 ms.
Exported basis to /tmp/petrispot-output-12889755433136353780.kers
Total runtime 29 ms.
[2026-05-22 21:17:24] [INFO ] Implicit Places using invariants in 514 ms returned []
[2026-05-22 21:17:24] [INFO ] Invariant cache hit.
[2026-05-22 21:17:26] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 637/1173 places, 1567/1985 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4657 ms. Remains : 637/1173 places, 1567/1985 transitions.
[2026-05-22 21:17:26] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (16903 resets) in 2648 ms. (377 steps per ms)
BEST_FIRST walk for 3000003 steps (8405 resets) in 2856 ms. (1050 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-22 21:17:31] [INFO ] Invariant cache hit.
[2026-05-22 21:17:32] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-22 21:17:32] [INFO ] [Real]Absence check using 20 positive and 46 generalized place invariants in 14 ms returned sat
[2026-05-22 21:17:32] [INFO ] [Real]Absence check using state equation in 567 ms returned sat
[2026-05-22 21:17:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:17:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2026-05-22 21:17:32] [INFO ] [Nat]Absence check using 20 positive and 46 generalized place invariants in 23 ms returned sat
[2026-05-22 21:17:33] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2026-05-22 21:17:33] [INFO ] Computed and/alt/rep : 374/1717/374 causal constraints (skipped 1152 transitions) in 105 ms.
[2026-05-22 21:17:36] [INFO ] Added : 113 causal constraints over 23 iterations in 3212 ms. Result :sat
Minimization took 1149 ms.
[2026-05-22 21:17:38] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-22 21:17:38] [INFO ] [Real]Absence check using 20 positive and 46 generalized place invariants in 13 ms returned sat
[2026-05-22 21:17:38] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2026-05-22 21:17:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:17:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-22 21:17:38] [INFO ] [Nat]Absence check using 20 positive and 46 generalized place invariants in 28 ms returned sat
[2026-05-22 21:17:39] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2026-05-22 21:17:39] [INFO ] Computed and/alt/rep : 374/1717/374 causal constraints (skipped 1152 transitions) in 117 ms.
[2026-05-22 21:17:41] [INFO ] Added : 64 causal constraints over 13 iterations in 1885 ms. Result :sat
Minimization took 966 ms.
[2026-05-22 21:17:42] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2026-05-22 21:17:42] [INFO ] [Real]Absence check using 20 positive and 46 generalized place invariants in 36 ms returned sat
[2026-05-22 21:17:43] [INFO ] [Real]Absence check using state equation in 599 ms returned sat
[2026-05-22 21:17:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:17:43] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2026-05-22 21:17:43] [INFO ] [Nat]Absence check using 20 positive and 46 generalized place invariants in 28 ms returned sat
[2026-05-22 21:17:44] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2026-05-22 21:17:44] [INFO ] Computed and/alt/rep : 374/1717/374 causal constraints (skipped 1152 transitions) in 91 ms.
[2026-05-22 21:17:46] [INFO ] Added : 84 causal constraints over 17 iterations in 2135 ms. Result :sat
Minimization took 1031 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA ASLink-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 637 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p664) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 637/637 places, 1566/1566 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 3890 edges and 636 vertex of which 635 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 635 transition count 1565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 635 transition count 1563
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 633 transition count 1563
Applied a total of 6 rules in 51 ms. Remains 633 /637 variables (removed 4) and now considering 1563/1566 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 633/637 places, 1563/1566 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11214706769786224399.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15444241633135167085.kers'
[2026-05-22 21:17:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11214706769786224399.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15444241633135167085.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1563 rows 633 cols 6372 entries
Finished phase 1 with 187 SingleSign rule and 381 generalized
[2026-05-22 21:17:48] [INFO ] Computed 65 invariants in 40 ms
Computed 65 P flows in 41 ms.
Exported basis to /tmp/petrispot-output-15444241633135167085.kers
Total runtime 45 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16955 resets) in 2817 ms. (354 steps per ms)
BEST_FIRST walk for 1000001 steps (2799 resets) in 1041 ms. (959 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 21:17:52] [INFO ] Invariant cache hit.
[2026-05-22 21:17:52] [INFO ] [Real]Absence check using 22 positive place invariants in 12 ms returned sat
[2026-05-22 21:17:52] [INFO ] [Real]Absence check using 22 positive and 43 generalized place invariants in 15 ms returned sat
[2026-05-22 21:17:53] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2026-05-22 21:17:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:17:53] [INFO ] [Nat]Absence check using 22 positive place invariants in 10 ms returned sat
[2026-05-22 21:17:53] [INFO ] [Nat]Absence check using 22 positive and 43 generalized place invariants in 15 ms returned sat
[2026-05-22 21:17:53] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2026-05-22 21:17:54] [INFO ] Computed and/alt/rep : 362/1633/362 causal constraints (skipped 1160 transitions) in 114 ms.
[2026-05-22 21:17:54] [INFO ] Added : 22 causal constraints over 5 iterations in 771 ms. Result :sat
Minimization took 911 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1563/1563 transitions.
Applied a total of 0 rules in 21 ms. Remains 633 /633 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 633/633 places, 1563/1563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1563/1563 transitions.
Applied a total of 0 rules in 20 ms. Remains 633 /633 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
[2026-05-22 21:17:56] [INFO ] Invariant cache hit.
[2026-05-22 21:17:56] [INFO ] Implicit Places using invariants in 600 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 609 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 632/633 places, 1563/1563 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 631 transition count 1562
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 631 transition count 1561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 630 transition count 1561
Applied a total of 4 rules in 111 ms. Remains 630 /632 variables (removed 2) and now considering 1561/1563 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3401829932092463812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7290515611021954542.kers'
[2026-05-22 21:17:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3401829932092463812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7290515611021954542.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1561 rows 630 cols 6380 entries
Finished phase 1 with 186 SingleSign rule and 380 generalized
[2026-05-22 21:17:56] [INFO ] Computed 64 invariants in 32 ms
Computed 64 P flows in 33 ms.
Exported basis to /tmp/petrispot-output-7290515611021954542.kers
Total runtime 35 ms.
[2026-05-22 21:17:57] [INFO ] Implicit Places using invariants in 687 ms returned []
[2026-05-22 21:17:57] [INFO ] Invariant cache hit.
[2026-05-22 21:17:59] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 630/633 places, 1561/1563 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3036 ms. Remains : 630/633 places, 1561/1563 transitions.
[2026-05-22 21:17:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (16694 resets) in 2530 ms. (395 steps per ms)
BEST_FIRST walk for 1000001 steps (2805 resets) in 964 ms. (1036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-22 21:18:02] [INFO ] Invariant cache hit.
[2026-05-22 21:18:02] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2026-05-22 21:18:02] [INFO ] [Real]Absence check using 20 positive and 44 generalized place invariants in 11 ms returned sat
[2026-05-22 21:18:03] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2026-05-22 21:18:03] [INFO ] Solution in real domain found non-integer solution.
[2026-05-22 21:18:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2026-05-22 21:18:03] [INFO ] [Nat]Absence check using 20 positive and 44 generalized place invariants in 10 ms returned sat
[2026-05-22 21:18:04] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2026-05-22 21:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2026-05-22 21:18:04] [INFO ] Computed and/alt/rep : 353/1560/353 causal constraints (skipped 1167 transitions) in 73 ms.
[2026-05-22 21:18:05] [INFO ] Added : 42 causal constraints over 9 iterations in 1115 ms. Result :sat
Minimization took 708 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1561/1561 transitions.
Applied a total of 0 rules in 21 ms. Remains 630 /630 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 630/630 places, 1561/1561 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1561/1561 transitions.
Applied a total of 0 rules in 20 ms. Remains 630 /630 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2026-05-22 21:18:06] [INFO ] Invariant cache hit.
[2026-05-22 21:18:07] [INFO ] Implicit Places using invariants in 630 ms returned []
[2026-05-22 21:18:07] [INFO ] Invariant cache hit.
[2026-05-22 21:18:08] [INFO ] Implicit Places using invariants and state equation in 1704 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2026-05-22 21:18:08] [INFO ] Redundant transitions in 154 ms returned []
Running 1520 sub problems to find dead transitions.
[2026-05-22 21:18:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 628/2191 variables, and 60 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 42/44 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 1520/1520 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/628 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/628 variables, 42/60 constraints. Problems are: Problem set: 0 solved, 1520 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 628/2191 variables, and 60 constraints, problems are : Problem set: 0 solved, 1520 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 18/20 constraints, Generalized P Invariants (flows): 42/44 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 0/1520 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60698ms problems are : Problem set: 0 solved, 1520 unsolved
Search for dead transitions found 0 dead transitions in 60720ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63268 ms. Remains : 630/630 places, 1561/1561 transitions.
RANDOM walk for 40000 steps (686 resets) in 704 ms. (56 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (112 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
[2026-05-22 21:19:10] [INFO ] Flatten gal took : 184 ms
[2026-05-22 21:19:10] [INFO ] Flatten gal took : 83 ms
[2026-05-22 21:19:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1995024753414399114.gal : 35 ms
[2026-05-22 21:19:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7768230833059031970.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/ReachabilityCardinality1995024753414399114.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7768230833059031970.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7768230833059031970.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 6
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :6 after 38
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :38 after 44
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :44 after 328
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :328 after 18272
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :18272 after 3.05395e+07
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3.05395e+07 after 6.26279e+07
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6.26279e+07 after 6.41589e+07
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6.41589e+07 after 6.41682e+07
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6.41682e+07 after 2.02028e+09
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :2.02028e+09 after 2.706e+10
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Interrupted probabilistic random walk after 199463 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 199463 steps, saw 103461 distinct states, run finished after 3006 ms. (steps per millisecond=66 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA ASLink-PT-08b-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-22 21:19:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (16788 resets) in 2701 ms. (370 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 288762 ms.
BK_STOP 1779484755829
--------------------
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-08b"
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-08b, 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-177944366200405"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;