About the Execution of ITS-Tools for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4381.775 | 1123362.00 | 1347794.00 | 22276.90 | 1 1 6 6 6 5 6 6 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/fkordon/mcc2026-input.r194-tall-177969914300725.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-tall-177969914300725
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 132K Mar 8 07:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 558K Mar 8 07:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 86K Mar 8 07:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 403K Mar 8 07:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 75K Mar 16 08:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 221K Mar 16 08:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 45K Mar 16 08:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 167K Mar 16 08:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 175K Mar 8 07:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 705K Mar 8 07:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 190K Mar 8 07:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 828K Mar 8 07:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Mar 16 08:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Mar 16 08:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 535K 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 Peterson-PT-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779820612152
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-26 18:36:53] [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-26 18:36:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 18:36:53] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2026-05-26 18:36:53] [INFO ] Transformed 834 places.
[2026-05-26 18:36:53] [INFO ] Transformed 1242 transitions.
[2026-05-26 18:36:53] [INFO ] Found NUPN structural information;
[2026-05-26 18:36:53] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0] Max Struct:[6, 180, 180, 180, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 180, 180, 180, 30, 30, 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-3390090363040309798.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9056843299996224377.kers'
[2026-05-26 18:36:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3390090363040309798.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9056843299996224377.kers]
Normalized transition count is 1122 out of 1242 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 1122 rows 822 cols 2544 entries
Finished phase 1 with 810 SingleSign rule and 1 generalized
[2026-05-26 18:36:53] [INFO ] Computed 23 invariants in 4 ms
Computed 23 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9056843299996224377.kers
Total runtime 6 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[6, 180, 180, 180, 30, 30, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 139 ms. (71 steps per ms)
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (18 resets) in 242 ms. (370 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6, 6, 2, 5, 6, 0, 0, 0] Max Struct:[6, 180, 180, 180, 30, 30, 1, 1, 1]
[2026-05-26 18:36:54] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4288281907935680968.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3807582830553187637.kers'
[2026-05-26 18:36:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4288281907935680968.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3807582830553187637.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 1122 rows 822 cols 2544 entries
Finished phase 1 with 810 SingleSign rule and 1 generalized
[2026-05-26 18:36:54] [INFO ] Computed 23 invariants in 6 ms
Computed 23 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-3807582830553187637.kers
Total runtime 9 ms.
[2026-05-26 18:36:54] [INFO ] [Real]Absence check using 17 positive place invariants in 31 ms returned sat
[2026-05-26 18:36:54] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:36:54] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2026-05-26 18:36:54] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:36:55] [INFO ] [Real]Added 205 Read/Feed constraints in 83 ms returned sat
[2026-05-26 18:36:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:36:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2026-05-26 18:36:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:36:55] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2026-05-26 18:36:55] [INFO ] [Nat]Added 205 Read/Feed constraints in 161 ms returned sat
[2026-05-26 18:37:00] [INFO ] Trap strengthening (SAT) tested/added 4/4 trap constraints in 4207 ms
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned unsat
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned unsat
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-26 18:37:00] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-26 18:37:01] [INFO ] [Real]Added 205 Read/Feed constraints in 50 ms returned sat
[2026-05-26 18:37:01] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:37:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2026-05-26 18:37:01] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-26 18:37:01] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2026-05-26 18:37:01] [INFO ] [Nat]Added 205 Read/Feed constraints in 189 ms returned sat
[2026-05-26 18:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2026-05-26 18:37:02] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 73 ms.
[2026-05-26 18:37:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1134)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 18:37:06] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-26 18:37:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2026-05-26 18:37:06] [INFO ] [Real]Absence check using state equation in 353 ms returned sat
[2026-05-26 18:37:06] [INFO ] [Real]Added 205 Read/Feed constraints in 116 ms returned sat
[2026-05-26 18:37:06] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:37:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2026-05-26 18:37:06] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2026-05-26 18:37:07] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2026-05-26 18:37:07] [INFO ] [Nat]Added 205 Read/Feed constraints in 225 ms returned sat
[2026-05-26 18:37:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1939 ms
[2026-05-26 18:37:09] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-26 18:37:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned unsat
[2026-05-26 18:37:09] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-26 18:37:09] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-26 18:37:10] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2026-05-26 18:37:10] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2026-05-26 18:37:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:37:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2026-05-26 18:37:10] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-26 18:37:10] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2026-05-26 18:37:10] [INFO ] [Nat]Added 205 Read/Feed constraints in 25 ms returned sat
[2026-05-26 18:37:10] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 44 ms.
[2026-05-26 18:37:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-26 18:37:15] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2026-05-26 18:37:15] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-26 18:37:15] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-26 18:37:15] [INFO ] [Real]Added 205 Read/Feed constraints in 24 ms returned sat
[2026-05-26 18:37:15] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:37:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2026-05-26 18:37:15] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2026-05-26 18:37:16] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2026-05-26 18:37:16] [INFO ] [Nat]Added 205 Read/Feed constraints in 32 ms returned sat
[2026-05-26 18:37:16] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 59 ms.
[2026-05-26 18:37:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2026-05-26 18:37:20] [INFO ] Added : 229 causal constraints over 46 iterations in 4267 ms. Result :sat
Minimization took 217 ms.
[2026-05-26 18:37:20] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2026-05-26 18:37:20] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:37:21] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2026-05-26 18:37:21] [INFO ] [Real]Added 205 Read/Feed constraints in 21 ms returned sat
[2026-05-26 18:37:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:37:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2026-05-26 18:37:21] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2026-05-26 18:37:21] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2026-05-26 18:37:21] [INFO ] [Nat]Added 205 Read/Feed constraints in 29 ms returned sat
[2026-05-26 18:37:21] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 45 ms.
Maximisation of solution failed !
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6, 6, 2, 5, 6, 0, 0, 0] Max Struct:[6, 6, 6, 180, 5, 6, 1, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
Support contains 188 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 834 transition count 1094
Reduce places removed 148 places and 0 transitions.
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Iterating post reduction 1 with 298 rules applied. Total rules applied 446 place count 686 transition count 944
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 596 place count 536 transition count 944
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 596 place count 536 transition count 890
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 704 place count 482 transition count 890
Applied a total of 704 rules in 2024 ms. Remains 482 /834 variables (removed 352) and now considering 890/1242 (removed 352) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2032 ms. Remains : 482/834 places, 890/1242 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16696144455603373386.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-258413786036820816.kers'
[2026-05-26 18:37:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16696144455603373386.kers, --Pflows, --basisKERS=/tmp/petrispot-output-258413786036820816.kers]
Normalized transition count is 770 out of 890 initially.
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 770 rows 470 cols 1840 entries
Finished phase 1 with 458 SingleSign rule and 1 generalized
[2026-05-26 18:37:28] [INFO ] Computed 23 invariants in 2 ms
Computed 23 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-258413786036820816.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3828 ms. (261 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 5415 ms. (923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 5, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
[2026-05-26 18:37:37] [INFO ] Flow matrix only has 770 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8118665338194248973.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-933628761834391398.kers'
[2026-05-26 18:37:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8118665338194248973.kers, --Pflows, --basisKERS=/tmp/petrispot-output-933628761834391398.kers]
Culling duplicate invariants (modulo rational): removing 12 columns.
Culled 12 columns in 0 ms.
// Phase 1: matrix 770 rows 470 cols 1840 entries
Finished phase 1 with 458 SingleSign rule and 1 generalized
[2026-05-26 18:37:37] [INFO ] Computed 23 invariants in 2 ms
Computed 23 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-933628761834391398.kers
Total runtime 3 ms.
[2026-05-26 18:37:37] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2026-05-26 18:37:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:37:38] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2026-05-26 18:37:38] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:37:38] [INFO ] [Real]Added 205 Read/Feed constraints in 35 ms returned sat
[2026-05-26 18:37:38] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:37:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 12 ms returned sat
[2026-05-26 18:37:38] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:37:38] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2026-05-26 18:37:38] [INFO ] [Nat]Added 205 Read/Feed constraints in 121 ms returned sat
[2026-05-26 18:38:12] [INFO ] Trap strengthening (SAT) tested/added 74/74 trap constraints in 33588 ms
[2026-05-26 18:38:12] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2026-05-26 18:38:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-26 18:38:12] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2026-05-26 18:38:12] [INFO ] [Real]Added 205 Read/Feed constraints in 44 ms returned sat
[2026-05-26 18:38:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:38:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2026-05-26 18:38:12] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2026-05-26 18:38:12] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2026-05-26 18:38:12] [INFO ] [Nat]Added 205 Read/Feed constraints in 92 ms returned sat
[2026-05-26 18:38:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1884 ms
[2026-05-26 18:38:14] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 41 ms.
[2026-05-26 18:38:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 492 ms
[2026-05-26 18:38:17] [INFO ] Added : 152 causal constraints over 31 iterations in 2346 ms. Result :sat
Minimization took 569 ms.
[2026-05-26 18:38:17] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2026-05-26 18:38:17] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-26 18:38:17] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2026-05-26 18:38:17] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:38:17] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:38:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2026-05-26 18:38:18] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2026-05-26 18:38:18] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2026-05-26 18:38:18] [INFO ] [Nat]Added 205 Read/Feed constraints in 26 ms returned sat
[2026-05-26 18:38:18] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 42 ms.
[2026-05-26 18:38:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1613 ms
[2026-05-26 18:38:21] [INFO ] Added : 134 causal constraints over 28 iterations in 3141 ms. Result :sat
Minimization took 376 ms.
[2026-05-26 18:38:21] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2026-05-26 18:38:21] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:38:22] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2026-05-26 18:38:22] [INFO ] [Real]Added 205 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:38:22] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:38:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2026-05-26 18:38:22] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:38:22] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2026-05-26 18:38:22] [INFO ] [Nat]Added 205 Read/Feed constraints in 20 ms returned sat
[2026-05-26 18:38:22] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 41 ms.
[2026-05-26 18:38:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4405 ms
[2026-05-26 18:38:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2026-05-26 18:38:30] [INFO ] Added : 216 causal constraints over 45 iterations in 7953 ms. Result :sat
Minimization took 413 ms.
[2026-05-26 18:38:30] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2026-05-26 18:38:30] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:38:31] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2026-05-26 18:38:31] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:38:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:38:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2026-05-26 18:38:31] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2026-05-26 18:38:31] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-26 18:38:31] [INFO ] [Nat]Added 205 Read/Feed constraints in 20 ms returned sat
[2026-05-26 18:38:31] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 28 ms.
[2026-05-26 18:38:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1357 ms
[2026-05-26 18:38:34] [INFO ] Added : 116 causal constraints over 24 iterations in 3504 ms. Result :sat
Minimization took 372 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 5, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 6, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
Support contains 188 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 890/890 transitions.
Applied a total of 0 rules in 26 ms. Remains 482 /482 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 482/482 places, 890/890 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 890/890 transitions.
Applied a total of 0 rules in 19 ms. Remains 482 /482 variables (removed 0) and now considering 890/890 (removed 0) transitions.
[2026-05-26 18:38:36] [INFO ] Flow matrix only has 770 transitions (discarded 120 similar events)
[2026-05-26 18:38:36] [INFO ] Invariant cache hit.
[2026-05-26 18:38:36] [INFO ] Implicit Places using invariants in 583 ms returned [441, 453, 454, 455, 456, 457]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 588 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 476/482 places, 890/890 transitions.
Applied a total of 0 rules in 19 ms. Remains 476 /476 variables (removed 0) and now considering 890/890 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 632 ms. Remains : 476/482 places, 890/890 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7642628019355848378.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16046453359537404883.kers'
[2026-05-26 18:38:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7642628019355848378.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16046453359537404883.kers]
Normalized transition count is 770 out of 890 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 770 rows 470 cols 1840 entries
Finished phase 1 with 458 SingleSign rule and 1 generalized
[2026-05-26 18:38:36] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16046453359537404883.kers
Total runtime 4 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 6, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 3891 ms. (256 steps per ms)
BEST_FIRST walk for 5000005 steps (10 resets) in 5510 ms. (907 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 6, 0, 0, 0] Max Struct:[6, 180, 1, 1, 1]
[2026-05-26 18:38:46] [INFO ] Flow matrix only has 770 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5249429383929246773.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14005934406786847035.kers'
[2026-05-26 18:38:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5249429383929246773.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14005934406786847035.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 770 rows 470 cols 1840 entries
Finished phase 1 with 458 SingleSign rule and 1 generalized
[2026-05-26 18:38:46] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-14005934406786847035.kers
Total runtime 6 ms.
[2026-05-26 18:38:46] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-26 18:38:46] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:38:46] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2026-05-26 18:38:46] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:38:46] [INFO ] [Real]Added 205 Read/Feed constraints in 30 ms returned sat
[2026-05-26 18:38:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:38:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-05-26 18:38:46] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:38:46] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2026-05-26 18:38:47] [INFO ] [Nat]Added 205 Read/Feed constraints in 113 ms returned sat
[2026-05-26 18:39:31] [INFO ] Trap strengthening (SAT) tested/added 122/122 trap constraints in 44619 ms
[2026-05-26 18:39:31] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2026-05-26 18:39:31] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned unsat
[2026-05-26 18:39:31] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-26 18:39:31] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:32] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2026-05-26 18:39:32] [INFO ] [Real]Added 205 Read/Feed constraints in 27 ms returned sat
[2026-05-26 18:39:32] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:39:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2026-05-26 18:39:32] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:32] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2026-05-26 18:39:32] [INFO ] [Nat]Added 205 Read/Feed constraints in 24 ms returned sat
[2026-05-26 18:39:32] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 35 ms.
[2026-05-26 18:39:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 686 ms
[2026-05-26 18:39:34] [INFO ] Added : 71 causal constraints over 16 iterations in 1838 ms. Result :sat
Minimization took 360 ms.
[2026-05-26 18:39:34] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-26 18:39:34] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:34] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2026-05-26 18:39:34] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:39:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:39:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-26 18:39:35] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:39:35] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2026-05-26 18:39:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 25 ms returned sat
[2026-05-26 18:39:35] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 38 ms.
[2026-05-26 18:39:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2939 ms
[2026-05-26 18:39:41] [INFO ] Added : 187 causal constraints over 39 iterations in 5998 ms. Result :sat
Minimization took 407 ms.
[2026-05-26 18:39:41] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2026-05-26 18:39:41] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:42] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2026-05-26 18:39:42] [INFO ] [Real]Added 205 Read/Feed constraints in 18 ms returned sat
[2026-05-26 18:39:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:39:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2026-05-26 18:39:42] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:42] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2026-05-26 18:39:42] [INFO ] [Nat]Added 205 Read/Feed constraints in 21 ms returned sat
[2026-05-26 18:39:42] [INFO ] Computed and/alt/rep : 704/1760/704 causal constraints (skipped 60 transitions) in 36 ms.
[2026-05-26 18:39:45] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2106 ms
[2026-05-26 18:39:47] [INFO ] Added : 186 causal constraints over 38 iterations in 4630 ms. Result :sat
Minimization took 365 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 6, 0, 0, 0] Max Struct:[6, 6, 1, 1, 1]
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
Support contains 8 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 890/890 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 476 transition count 835
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 110 place count 421 transition count 835
Performed 124 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 124 Pre rules applied. Total rules applied 110 place count 421 transition count 711
Deduced a syphon composed of 124 places in 0 ms
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 358 place count 297 transition count 711
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 418 place count 267 transition count 681
Applied a total of 418 rules in 38 ms. Remains 267 /476 variables (removed 209) and now considering 681/890 (removed 209) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 267/476 places, 681/890 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17336874068267968498.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16053252350208362787.kers'
[2026-05-26 18:39:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17336874068267968498.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16053252350208362787.kers]
Normalized transition count is 561 out of 681 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 561 rows 261 cols 1422 entries
Finished phase 1 with 249 SingleSign rule and 1 generalized
[2026-05-26 18:39:47] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16053252350208362787.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1665 ms. (600 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1552 ms. (1931 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
[2026-05-26 18:39:50] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-20272921132658101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1344724300569300364.kers'
[2026-05-26 18:39:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-20272921132658101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1344724300569300364.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 561 rows 261 cols 1422 entries
Finished phase 1 with 249 SingleSign rule and 1 generalized
[2026-05-26 18:39:50] [INFO ] Computed 17 invariants in 6 ms
Computed 17 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1344724300569300364.kers
Total runtime 7 ms.
[2026-05-26 18:39:50] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:39:50] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:51] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-26 18:39:51] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:39:51] [INFO ] [Real]Added 205 Read/Feed constraints in 21 ms returned sat
[2026-05-26 18:39:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:39:51] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-26 18:39:51] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:39:51] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2026-05-26 18:39:51] [INFO ] [Nat]Added 205 Read/Feed constraints in 45 ms returned sat
[2026-05-26 18:40:24] [INFO ] Trap strengthening (SAT) tested/added 117/117 trap constraints in 33062 ms
[2026-05-26 18:40:24] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:40:24] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:40:24] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2026-05-26 18:40:24] [INFO ] [Real]Added 205 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:40:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:40:24] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-26 18:40:24] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:40:24] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2026-05-26 18:40:24] [INFO ] [Nat]Added 205 Read/Feed constraints in 18 ms returned sat
[2026-05-26 18:40:24] [INFO ] Computed and/alt/rep : 495/1551/495 causal constraints (skipped 60 transitions) in 29 ms.
[2026-05-26 18:40:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1600 ms
[2026-05-26 18:40:27] [INFO ] Added : 79 causal constraints over 17 iterations in 2369 ms. Result :sat
Minimization took 146 ms.
[2026-05-26 18:40:27] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-26 18:40:27] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:40:27] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2026-05-26 18:40:27] [INFO ] [Real]Added 205 Read/Feed constraints in 15 ms returned sat
[2026-05-26 18:40:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:40:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:40:27] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:40:27] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2026-05-26 18:40:27] [INFO ] [Nat]Added 205 Read/Feed constraints in 20 ms returned sat
[2026-05-26 18:40:27] [INFO ] Computed and/alt/rep : 495/1551/495 causal constraints (skipped 60 transitions) in 29 ms.
[2026-05-26 18:40:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 573 ms
[2026-05-26 18:40:28] [INFO ] Added : 56 causal constraints over 12 iterations in 1141 ms. Result :sat
Minimization took 137 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0, 0] Max Struct:[6, 1, 1]
Support contains 8 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 681/681 transitions.
Applied a total of 0 rules in 14 ms. Remains 267 /267 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 267/267 places, 681/681 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 681/681 transitions.
Applied a total of 0 rules in 16 ms. Remains 267 /267 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2026-05-26 18:40:29] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
[2026-05-26 18:40:29] [INFO ] Invariant cache hit.
[2026-05-26 18:40:29] [INFO ] Implicit Places using invariants in 287 ms returned []
[2026-05-26 18:40:29] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
[2026-05-26 18:40:29] [INFO ] Invariant cache hit.
[2026-05-26 18:40:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:40:30] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1203 ms to find 0 implicit places.
[2026-05-26 18:40:30] [INFO ] Redundant transitions in 41 ms returned []
Running 675 sub problems to find dead transitions.
[2026-05-26 18:40:30] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
[2026-05-26 18:40:30] [INFO ] Invariant cache hit.
[2026-05-26 18:40:30] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 267/267 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 20/304 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/324 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 20/364 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/267 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 267/828 variables, and 384 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30029 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/267 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 675/675 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 675 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 267/267 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/267 variables, 16/283 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 100/384 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 20/404 constraints. Problems are: Problem set: 0 solved, 675 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 20/424 constraints. Problems are: Problem set: 0 solved, 675 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/828 variables, and 426 constraints, problems are : Problem set: 0 solved, 675 unsolved in 30021 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/267 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/675 constraints, Known Traps: 142/142 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60200ms problems are : Problem set: 0 solved, 675 unsolved
Search for dead transitions found 0 dead transitions in 60213ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61511 ms. Remains : 267/267 places, 681/681 transitions.
RANDOM walk for 40000 steps (8 resets) in 1060 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
[2026-05-26 18:41:31] [INFO ] Flatten gal took : 176 ms
[2026-05-26 18:41:31] [INFO ] Flatten gal took : 79 ms
[2026-05-26 18:41:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7476090170399586066.gal : 47 ms
[2026-05-26 18:41:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15515320247460201820.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/ReachabilityCardinality7476090170399586066.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15515320247460201820.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality15515320247460201820.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :17 after 32
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :32 after 102
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :102 after 215
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :215 after 348
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :348 after 692
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :692 after 3742
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3742 after 8299
Interrupted probabilistic random walk after 600684 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 6
Probabilistic random walk after 600684 steps, saw 87162 distinct states, run finished after 3022 ms. (steps per millisecond=198 ) properties seen :0
[2026-05-26 18:41:34] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
[2026-05-26 18:41:34] [INFO ] Invariant cache hit.
[2026-05-26 18:41:34] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 186/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 186/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/199 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 37/236 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 37/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/237 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :8299 after 35206
At refinement iteration 14 (OVERLAPS) 561/798 variables, 237/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 205/691 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 30/828 variables, 30/721 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 30/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/828 variables, 5/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/828 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/828 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/828 variables, and 756 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2009 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 267/267 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 186/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 186/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 5/199 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 37/236 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 37/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/237 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 561/798 variables, 237/486 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 205/691 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 6/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 30/828 variables, 30/727 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/828 variables, 30/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/828 variables, 5/762 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :35206 after 94793
Problem MAX0 is UNSAT
At refinement iteration 21 (INCLUDED_ONLY) 0/828 variables, 20/782 constraints. Problems are: Problem set: 1 solved, 5 unsolved
SMT process timed out in 7026ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 819 ms.
Support contains 8 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 681/681 transitions.
Applied a total of 0 rules in 33 ms. Remains 267 /267 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 267/267 places, 681/681 transitions.
RANDOM walk for 40000 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 652043 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :0 out of 5
Probabilistic random walk after 652043 steps, saw 95093 distinct states, run finished after 3001 ms. (steps per millisecond=217 ) properties seen :0
[2026-05-26 18:41:45] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
[2026-05-26 18:41:45] [INFO ] Invariant cache hit.
[2026-05-26 18:41:45] [INFO ] State equation strengthened by 205 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 32768
At refinement iteration 2 (OVERLAPS) 186/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD size :94793 after 188681
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 186/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/199 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 37/236 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 37/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/237 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 561/798 variables, 237/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 205/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 0/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 30/828 variables, 30/721 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 30/751 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/828 variables, 5/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/828 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/828 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/828 variables, and 756 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4109 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 267/267 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 186/194 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 186/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 5/199 variables, 5/204 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 37/236 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 37/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/237 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 561/798 variables, 237/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 205/691 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/798 variables, 5/696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/798 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 30/828 variables, 30/726 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/828 variables, 30/756 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/828 variables, 5/761 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/828 variables, 20/781 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/828 variables, 20/801 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/828 variables, 20/821 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :188681 after 418149
At refinement iteration 24 (INCLUDED_ONLY) 0/828 variables, 20/841 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Detected timeout of ITS tools.
[2026-05-26 18:42:22] [INFO ] Flatten gal took : 32 ms
[2026-05-26 18:42:22] [INFO ] Applying decomposition
[2026-05-26 18:42:22] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3274548770335924149.txt' '-o' '/tmp/graph3274548770335924149.bin' '-w' '/tmp/graph3274548770335924149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3274548770335924149.bin' '-l' '-1' '-v' '-w' '/tmp/graph3274548770335924149.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:42:22] [INFO ] Decomposing Gal with order
[2026-05-26 18:42:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:42:22] [INFO ] Removed a total of 939 redundant transitions.
[2026-05-26 18:42:22] [INFO ] Flatten gal took : 135 ms
[2026-05-26 18:42:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2026-05-26 18:42:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11101336477337737258.gal : 9 ms
[2026-05-26 18:42:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13135652761298258097.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11101336477337737258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13135652761298258097.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13135652761298258097.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 11
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :12 after 28
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :28 after 100
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :100 after 182
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :182 after 548
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :548 after 2584
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :2584 after 7011
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :7011 after 14060
At refinement iteration 25 (INCLUDED_ONLY) 0/828 variables, 20/861 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :14060 after 115113
Problem MIN0 is UNSAT
At refinement iteration 26 (INCLUDED_ONLY) 0/828 variables, 11/872 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :115113 after 270445
At refinement iteration 27 (INCLUDED_ONLY) 0/828 variables, 0/872 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/828 variables, 0/872 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/828 variables, and 872 constraints, problems are : Problem set: 1 solved, 4 unsolved in 40491 ms.
Refiners :[Domain max(s): 267/267 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 267/267 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44609ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 604 ms.
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 681/681 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 267 transition count 675
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 261 transition count 675
Applied a total of 12 rules in 21 ms. Remains 261 /267 variables (removed 6) and now considering 675/681 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 261/267 places, 675/681 transitions.
RANDOM walk for 40000 steps (8 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 772590 steps, run timeout after 3001 ms. (steps per millisecond=257 ) properties seen :0 out of 4
Probabilistic random walk after 772590 steps, saw 112316 distinct states, run finished after 3001 ms. (steps per millisecond=257 ) properties seen :0
[2026-05-26 18:42:34] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14695576042153903979.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-989260697171577000.kers'
[2026-05-26 18:42:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14695576042153903979.kers, --Pflows, --basisKERS=/tmp/petrispot-output-989260697171577000.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:42:34] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-989260697171577000.kers
Total runtime 3 ms.
[2026-05-26 18:42:34] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/136 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 155/291 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 30/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 275/566 variables, 50/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 50/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 195/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 108/674 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/674 variables, 108/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/678 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/678 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/678 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 27/705 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/705 variables, 27/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/706 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/706 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/706 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 110/816 variables, 140/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/816 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/816 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3477 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 261/261 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/136 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 155/291 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 30/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 275/566 variables, 50/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 50/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 195/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 108/674 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 108/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/674 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/674 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/678 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/678 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/678 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/678 variables, 5/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/678 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 27/705 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/705 variables, 27/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/705 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 1/706 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/706 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/706 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/706 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/706 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 110/816 variables, 140/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/816 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 0/816 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 760 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2987 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 261/261 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6479ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 20 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 261/261 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 13 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2026-05-26 18:42:40] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:42:40] [INFO ] Invariant cache hit.
[2026-05-26 18:42:41] [INFO ] Implicit Places using invariants in 214 ms returned []
[2026-05-26 18:42:41] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:42:41] [INFO ] Invariant cache hit.
[2026-05-26 18:42:41] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:42:41] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1090 ms to find 0 implicit places.
[2026-05-26 18:42:41] [INFO ] Redundant transitions in 10 ms returned []
Running 669 sub problems to find dead transitions.
[2026-05-26 18:42:41] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:42:41] [INFO ] Invariant cache hit.
[2026-05-26 18:42:41] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 16/277 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 669 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :270445 after 1.2913e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 20/298 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 20/318 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 20/338 constraints. Problems are: Problem set: 0 solved, 669 unsolved
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :1.2913e+06 after 4.88128e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 261/816 variables, and 375 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30017 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/261 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 669/669 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 669 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/261 variables, 261/261 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/261 variables, 16/277 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Detected timeout of ITS tools.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 97/375 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 261/816 variables, and 415 constraints, problems are : Problem set: 0 solved, 669 unsolved in 30031 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/261 constraints, ReadFeed: 0/205 constraints, PredecessorRefiner: 0/669 constraints, Known Traps: 137/137 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61278 ms. Remains : 261/261 places, 675/675 transitions.
FORMULA Peterson-PT-5-UpperBounds-01 1 TECHNIQUES REACHABILITY_MIN
FORMULA Peterson-PT-5-UpperBounds-00 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0] Max Struct:[1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7041061332253562276.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11616625903363198391.kers'
[2026-05-26 18:43:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7041061332253562276.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11616625903363198391.kers]
Normalized transition count is 561 out of 681 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 561 rows 261 cols 1422 entries
Finished phase 1 with 249 SingleSign rule and 1 generalized
[2026-05-26 18:43:42] [INFO ] Computed 17 invariants in 3 ms
Computed 17 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11616625903363198391.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1474 ms. (677 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 938 ms. (2129 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-26 18:43:44] [INFO ] Flow matrix only has 561 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9934625100232726026.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12620207308981526546.kers'
[2026-05-26 18:43:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9934625100232726026.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12620207308981526546.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 561 rows 261 cols 1422 entries
Finished phase 1 with 249 SingleSign rule and 1 generalized
[2026-05-26 18:43:44] [INFO ] Computed 17 invariants in 6 ms
Computed 17 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-12620207308981526546.kers
Total runtime 7 ms.
[2026-05-26 18:43:44] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:43:44] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:43:44] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2026-05-26 18:43:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:43:44] [INFO ] [Real]Added 205 Read/Feed constraints in 16 ms returned sat
[2026-05-26 18:43:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:43:44] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-26 18:43:44] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:43:44] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2026-05-26 18:43:44] [INFO ] [Nat]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:43:45] [INFO ] Computed and/alt/rep : 495/1551/495 causal constraints (skipped 60 transitions) in 28 ms.
[2026-05-26 18:43:47] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1596 ms
[2026-05-26 18:43:47] [INFO ] Added : 79 causal constraints over 17 iterations in 2418 ms. Result :sat
Minimization took 152 ms.
[2026-05-26 18:43:47] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:43:47] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:43:47] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2026-05-26 18:43:47] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:43:47] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:43:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-26 18:43:47] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:43:47] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2026-05-26 18:43:47] [INFO ] [Nat]Added 205 Read/Feed constraints in 18 ms returned sat
[2026-05-26 18:43:48] [INFO ] Computed and/alt/rep : 495/1551/495 causal constraints (skipped 60 transitions) in 29 ms.
[2026-05-26 18:43:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 574 ms
[2026-05-26 18:43:49] [INFO ] Added : 56 causal constraints over 12 iterations in 1165 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 267/267 places, 681/681 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 267 transition count 675
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 261 transition count 675
Applied a total of 12 rules in 15 ms. Remains 261 /267 variables (removed 6) and now considering 675/681 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 261/267 places, 675/681 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16974100493019677101.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14039293528804845050.kers'
[2026-05-26 18:43:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16974100493019677101.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14039293528804845050.kers]
Normalized transition count is 555 out of 675 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:43:49] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14039293528804845050.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1485 ms. (672 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 937 ms. (2132 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-26 18:43:51] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6640521818967450337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4589217754012098391.kers'
[2026-05-26 18:43:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6640521818967450337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4589217754012098391.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:43:51] [INFO ] Computed 17 invariants in 5 ms
Computed 17 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4589217754012098391.kers
Total runtime 7 ms.
[2026-05-26 18:43:51] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:43:51] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:43:52] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2026-05-26 18:43:52] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:43:52] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:43:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:43:52] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:43:52] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:43:52] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2026-05-26 18:43:52] [INFO ] [Nat]Added 205 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:43:52] [INFO ] Computed and/alt/rep : 489/1545/489 causal constraints (skipped 60 transitions) in 26 ms.
[2026-05-26 18:43:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2026-05-26 18:43:53] [INFO ] Added : 57 causal constraints over 12 iterations in 706 ms. Result :sat
Minimization took 100 ms.
[2026-05-26 18:43:53] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:43:53] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:43:53] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2026-05-26 18:43:53] [INFO ] [Real]Added 205 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:43:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:43:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-26 18:43:53] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 17 ms returned sat
[2026-05-26 18:43:53] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2026-05-26 18:43:53] [INFO ] [Nat]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:43:53] [INFO ] Computed and/alt/rep : 489/1545/489 causal constraints (skipped 60 transitions) in 30 ms.
[2026-05-26 18:43:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 653 ms
[2026-05-26 18:43:54] [INFO ] Added : 56 causal constraints over 12 iterations in 1261 ms. Result :sat
Minimization took 118 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 261/261 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 9 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2026-05-26 18:43:55] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:43:55] [INFO ] Invariant cache hit.
[2026-05-26 18:43:55] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-26 18:43:55] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:43:55] [INFO ] Invariant cache hit.
[2026-05-26 18:43:55] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:43:56] [INFO ] Implicit Places using invariants and state equation in 877 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2026-05-26 18:43:56] [INFO ] Redundant transitions in 3 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1135 ms. Remains : 261/261 places, 675/675 transitions.
[2026-05-26 18:43:56] [INFO ] Flatten gal took : 87 ms
RANDOM walk for 40000 steps (8 resets) in 282 ms. (141 steps per ms) remains 4/4 properties
[2026-05-26 18:43:56] [INFO ] Flatten gal took : 43 ms
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
[2026-05-26 18:43:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15632869496385545838.gal : 9 ms
[2026-05-26 18:43:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9716086988439136991.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15632869496385545838.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9716086988439136991.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality9716086988439136991.prop.
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :17 after 29
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :29 after 91
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :91 after 201
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :201 after 348
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :348 after 692
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :692 after 3688
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :3688 after 8175
Interrupted probabilistic random walk after 781998 steps, run timeout after 3001 ms. (steps per millisecond=260 ) properties seen :0 out of 4
Probabilistic random walk after 781998 steps, saw 114714 distinct states, run finished after 3002 ms. (steps per millisecond=260 ) properties seen :0
[2026-05-26 18:43:59] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:43:59] [INFO ] Invariant cache hit.
[2026-05-26 18:43:59] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/136 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 155/291 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 30/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :8175 after 17414
At refinement iteration 15 (OVERLAPS) 275/566 variables, 50/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 50/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 195/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 108/674 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/674 variables, 108/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/678 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/678 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/678 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 27/705 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/705 variables, 27/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/706 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/706 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/706 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 110/816 variables, 140/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/816 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/816 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 837 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 261/261 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/136 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 155/291 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 30/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 275/566 variables, 50/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 50/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 195/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 108/674 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 108/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/674 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/674 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/678 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/678 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/678 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/678 variables, 5/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/678 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 27/705 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/705 variables, 27/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/705 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 1/706 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/706 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :17414 after 91409
At refinement iteration 34 (INCLUDED_ONLY) 0/706 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/706 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/706 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 110/816 variables, 140/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/816 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 0/816 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 760 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3059 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 261/261 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3904ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 10 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 261/261 places, 675/675 transitions.
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 769748 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 4
Probabilistic random walk after 769748 steps, saw 112315 distinct states, run finished after 3001 ms. (steps per millisecond=256 ) properties seen :0
[2026-05-26 18:44:06] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:44:06] [INFO ] Invariant cache hit.
[2026-05-26 18:44:06] [INFO ] State equation strengthened by 205 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/136 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 155/291 variables, 30/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 30/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 5/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 275/566 variables, 50/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 50/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 195/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 108/674 variables, 4/458 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/674 variables, 108/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 4/678 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/678 variables, 4/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/678 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 27/705 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/705 variables, 27/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 1/706 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/706 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/706 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 110/816 variables, 140/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/816 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/816 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/816 variables, and 744 constraints, problems are : Problem set: 0 solved, 4 unsolved in 828 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 261/261 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/40 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 95/136 variables, 41/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 155/291 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 30/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 275/566 variables, 50/211 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 50/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 195/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 108/674 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/674 variables, 108/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/674 variables, 4/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/674 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 4/678 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/678 variables, 4/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/678 variables, 2/582 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/678 variables, 5/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/678 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 27/705 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/705 variables, 27/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/705 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 1/706 variables, 1/616 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/706 variables, 1/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :91409 after 192640
At refinement iteration 34 (INCLUDED_ONLY) 0/706 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/706 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/706 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 110/816 variables, 140/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/816 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 0/816 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/816 variables, and 760 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2959 ms.
Refiners :[Domain max(s): 261/261 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 261/261 constraints, ReadFeed: 205/205 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3795ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 133 ms.
Support contains 2 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 9 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 261/261 places, 675/675 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 675/675 transitions.
Applied a total of 0 rules in 8 ms. Remains 261 /261 variables (removed 0) and now considering 675/675 (removed 0) transitions.
[2026-05-26 18:44:10] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:44:10] [INFO ] Invariant cache hit.
[2026-05-26 18:44:10] [INFO ] Implicit Places using invariants in 376 ms returned []
[2026-05-26 18:44:10] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
[2026-05-26 18:44:10] [INFO ] Invariant cache hit.
[2026-05-26 18:44:11] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:44:11] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
[2026-05-26 18:44:11] [INFO ] Redundant transitions in 7 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1251 ms. Remains : 261/261 places, 675/675 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 508 edges and 261 vertex of which 176 / 261 are part of one of the 30 SCC in 7 ms
Free SCC test removed 146 places
Drop transitions (Empty/Sink Transition effects.) removed 292 transitions
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 440 transitions.
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 28 Pre rules applied. Total rules applied 1 place count 115 transition count 207
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 0 with 56 rules applied. Total rules applied 57 place count 87 transition count 207
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 63 place count 84 transition count 204
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 65 place count 84 transition count 202
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 87 place count 70 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 38 edges and 70 vertex of which 36 / 70 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 90 place count 40 transition count 204
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 173 edges and 35 vertex of which 17 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 75 output transitions
Drop transitions (Output transitions of discarded places.) removed 75 transitions
Graph (trivial) has 67 edges and 17 vertex of which 10 / 17 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 2 with 43 rules applied. Total rules applied 133 place count 9 transition count 93
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 212 place count 9 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 218 place count 5 transition count 12
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 222 place count 5 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 5 transition count 6
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 5 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 228 place count 3 transition count 4
Applied a total of 228 rules in 41 ms. Remains 3 /261 variables (removed 258) and now considering 4/675 (removed 671) transitions.
Running SMT prover for 4 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8483805847780571494.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13783353091755726917.kers'
[2026-05-26 18:44:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8483805847780571494.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13783353091755726917.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 4 rows 3 cols 8 entries
Finished phase 1 with 2 SingleSign rule and 0 generalized
[2026-05-26 18:44:11] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13783353091755726917.kers
Total runtime 2 ms.
[2026-05-26 18:44:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2026-05-26 18:44:11] [INFO ] After 6ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2026-05-26 18:44:11] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
[2026-05-26 18:44:11] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
[2026-05-26 18:44:11] [INFO ] Flatten gal took : 1 ms
[2026-05-26 18:44:11] [INFO ] Flatten gal took : 1 ms
[2026-05-26 18:44:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3868343923108644782.gal : 0 ms
[2026-05-26 18:44:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14835628486713017966.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3868343923108644782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14835628486713017966.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14835628486713017966.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3,0.002619,4156,2,6,5,20,10,0,24,12,0
Total reachable state count : 3
Verifying 4 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.002777,4156,2,4,6,20,10,0,26,12,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.002873,4156,2,4,6,20,10,0,26,12,0
Reachability property MAX1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,1,0.00296,4156,2,4,7,20,10,0,27,12,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,1,0.003046,4156,2,4,7,20,10,0,27,12,0
Over-approximation ignoring read arcs solved 0 properties in 97 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 18:44:12] [INFO ] Flatten gal took : 20 ms
[2026-05-26 18:44:12] [INFO ] Applying decomposition
[2026-05-26 18:44:12] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14928527818846498489.txt' '-o' '/tmp/graph14928527818846498489.bin' '-w' '/tmp/graph14928527818846498489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14928527818846498489.bin' '-l' '-1' '-v' '-w' '/tmp/graph14928527818846498489.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:44:12] [INFO ] Decomposing Gal with order
[2026-05-26 18:44:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:44:12] [INFO ] Removed a total of 916 redundant transitions.
[2026-05-26 18:44:12] [INFO ] Flatten gal took : 50 ms
[2026-05-26 18:44:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 17 ms.
[2026-05-26 18:44:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13853365093785315324.gal : 7 ms
[2026-05-26 18:44:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8914682591085680155.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13853365093785315324.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8914682591085680155.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8914682591085680155.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 843
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :843 after 1223
Detected timeout of ITS tools.
Starting property specific reduction for Peterson-PT-5-UpperBounds-08
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4001673004200246750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10443656361789767329.kers'
[2026-05-26 18:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4001673004200246750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10443656361789767329.kers]
Normalized transition count is 555 out of 675 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:45:02] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10443656361789767329.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 18:45:02] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10526579459480453368.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6257264384798148691.kers'
[2026-05-26 18:45:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10526579459480453368.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6257264384798148691.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:45:02] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6257264384798148691.kers
Total runtime 2 ms.
[2026-05-26 18:45:02] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:45:02] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:45:02] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2026-05-26 18:45:02] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:45:02] [INFO ] [Real]Added 205 Read/Feed constraints in 19 ms returned sat
[2026-05-26 18:45:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:45:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:45:02] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 17 ms returned sat
[2026-05-26 18:45:02] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2026-05-26 18:45:02] [INFO ] [Nat]Added 205 Read/Feed constraints in 15 ms returned sat
[2026-05-26 18:45:02] [INFO ] Computed and/alt/rep : 489/1545/489 causal constraints (skipped 60 transitions) in 34 ms.
[2026-05-26 18:45:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2026-05-26 18:45:03] [INFO ] Added : 57 causal constraints over 12 iterations in 672 ms. Result :sat
Minimization took 98 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 261 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place TestAlone_3_3_2) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 673/673 transitions.
Reduce places removed 1 places and 2 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 2 rules applied. Total rules applied 2 place count 260 transition count 670
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 668
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 258 transition count 667
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 257 transition count 667
Applied a total of 6 rules in 18 ms. Remains 257 /261 variables (removed 4) and now considering 667/673 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 257/261 places, 667/673 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13074779711717866033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10408301935481819307.kers'
[2026-05-26 18:45:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13074779711717866033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10408301935481819307.kers]
Normalized transition count is 547 out of 667 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 547 rows 251 cols 1394 entries
Finished phase 1 with 239 SingleSign rule and 1 generalized
[2026-05-26 18:45:03] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10408301935481819307.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1465 ms. (682 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 452 ms. (2207 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 18:45:05] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15204568675535045531.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4249697600822080352.kers'
[2026-05-26 18:45:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15204568675535045531.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4249697600822080352.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 547 rows 251 cols 1394 entries
Finished phase 1 with 239 SingleSign rule and 1 generalized
[2026-05-26 18:45:05] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4249697600822080352.kers
Total runtime 2 ms.
[2026-05-26 18:45:05] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2026-05-26 18:45:05] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:45:05] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2026-05-26 18:45:05] [INFO ] State equation strengthened by 202 read => feed constraints.
[2026-05-26 18:45:05] [INFO ] [Real]Added 202 Read/Feed constraints in 15 ms returned sat
[2026-05-26 18:45:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:45:05] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2026-05-26 18:45:05] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:45:05] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2026-05-26 18:45:05] [INFO ] [Nat]Added 202 Read/Feed constraints in 26 ms returned sat
[2026-05-26 18:45:06] [INFO ] Computed and/alt/rep : 481/1528/481 causal constraints (skipped 60 transitions) in 41 ms.
[2026-05-26 18:45:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2026-05-26 18:45:06] [INFO ] Added : 55 causal constraints over 12 iterations in 759 ms. Result :sat
Minimization took 113 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:[1] Max Struct:[1]
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Ending property specific reduction for Peterson-PT-5-UpperBounds-08 in 4674 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-12
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11851810910917364624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2016863460851683441.kers'
[2026-05-26 18:45:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11851810910917364624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2016863460851683441.kers]
Normalized transition count is 555 out of 675 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:45:06] [INFO ] Computed 17 invariants in 2 ms
Computed 17 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2016863460851683441.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (2 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 18:45:07] [INFO ] Flow matrix only has 555 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4056545016516610818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17553782912881700460.kers'
[2026-05-26 18:45:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4056545016516610818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17553782912881700460.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 555 rows 255 cols 1410 entries
Finished phase 1 with 243 SingleSign rule and 1 generalized
[2026-05-26 18:45:07] [INFO ] Computed 17 invariants in 4 ms
Computed 17 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-17553782912881700460.kers
Total runtime 4 ms.
[2026-05-26 18:45:07] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-26 18:45:07] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:45:07] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-26 18:45:07] [INFO ] State equation strengthened by 205 read => feed constraints.
[2026-05-26 18:45:07] [INFO ] [Real]Added 205 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:45:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:45:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:45:07] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 0 ms returned sat
[2026-05-26 18:45:07] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-26 18:45:07] [INFO ] [Nat]Added 205 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:45:07] [INFO ] Computed and/alt/rep : 489/1545/489 causal constraints (skipped 60 transitions) in 24 ms.
[2026-05-26 18:45:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 637 ms
[2026-05-26 18:45:08] [INFO ] Added : 56 causal constraints over 12 iterations in 1195 ms. Result :sat
Minimization took 109 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 261 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place BeginLoop_3_4_5) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 674/674 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 260 transition count 672
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 260 transition count 671
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 259 transition count 671
Applied a total of 3 rules in 14 ms. Remains 259 /261 variables (removed 2) and now considering 671/674 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 259/261 places, 671/674 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8399098052427247985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18265841536876249966.kers'
[2026-05-26 18:45:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8399098052427247985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18265841536876249966.kers]
Normalized transition count is 551 out of 671 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 551 rows 253 cols 1402 entries
Finished phase 1 with 241 SingleSign rule and 1 generalized
[2026-05-26 18:45:08] [INFO ] Computed 17 invariants in 1 ms
Computed 17 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18265841536876249966.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 1440 ms. (693 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 461 ms. (2164 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-26 18:45:10] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12149494703808013866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3601653341733142542.kers'
[2026-05-26 18:45:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12149494703808013866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3601653341733142542.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 551 rows 253 cols 1402 entries
Finished phase 1 with 241 SingleSign rule and 1 generalized
[2026-05-26 18:45:10] [INFO ] Computed 17 invariants in 4 ms
Computed 17 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-3601653341733142542.kers
Total runtime 6 ms.
[2026-05-26 18:45:10] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2026-05-26 18:45:10] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:45:10] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2026-05-26 18:45:10] [INFO ] State equation strengthened by 204 read => feed constraints.
[2026-05-26 18:45:10] [INFO ] [Real]Added 204 Read/Feed constraints in 13 ms returned sat
[2026-05-26 18:45:10] [INFO ] Solution in real domain found non-integer solution.
[2026-05-26 18:45:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2026-05-26 18:45:11] [INFO ] [Nat]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2026-05-26 18:45:11] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2026-05-26 18:45:11] [INFO ] [Nat]Added 204 Read/Feed constraints in 17 ms returned sat
[2026-05-26 18:45:11] [INFO ] Computed and/alt/rep : 485/1539/485 causal constraints (skipped 60 transitions) in 23 ms.
[2026-05-26 18:45:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2026-05-26 18:45:11] [INFO ] Added : 63 causal constraints over 13 iterations in 706 ms. Result :sat
Minimization took 105 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 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 10 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 11 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2026-05-26 18:45:12] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:45:12] [INFO ] Invariant cache hit.
[2026-05-26 18:45:12] [INFO ] Implicit Places using invariants in 322 ms returned []
[2026-05-26 18:45:12] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:45:12] [INFO ] Invariant cache hit.
[2026-05-26 18:45:12] [INFO ] State equation strengthened by 204 read => feed constraints.
[2026-05-26 18:45:13] [INFO ] Implicit Places using invariants and state equation in 904 ms returned []
Implicit Place search using SMT with State Equation took 1228 ms to find 0 implicit places.
[2026-05-26 18:45:13] [INFO ] Redundant transitions in 4 ms returned []
Running 665 sub problems to find dead transitions.
[2026-05-26 18:45:13] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:45:13] [INFO ] Invariant cache hit.
[2026-05-26 18:45:13] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 15/273 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 20/294 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 20/314 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 20/334 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 20/354 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 17/371 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 258/810 variables, and 371 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30019 ms.
Refiners :[Domain max(s): 258/259 constraints, Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/259 constraints, ReadFeed: 0/204 constraints, PredecessorRefiner: 665/665 constraints, Known Traps: 97/97 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 665 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/258 variables, 258/258 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/258 variables, 15/273 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 97/371 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 8/379 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 5/384 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 665 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 2/387 constraints. Problems are: Problem set: 0 solved, 665 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 258/810 variables, and 389 constraints, problems are : Problem set: 0 solved, 665 unsolved in 30018 ms.
Refiners :[Domain max(s): 258/259 constraints, Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/259 constraints, ReadFeed: 0/204 constraints, PredecessorRefiner: 0/665 constraints, Known Traps: 115/115 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 665 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61375 ms. Remains : 259/259 places, 671/671 transitions.
[2026-05-26 18:46:13] [INFO ] Flatten gal took : 36 ms
RANDOM walk for 40000 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
[2026-05-26 18:46:13] [INFO ] Flatten gal took : 22 ms
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
[2026-05-26 18:46:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11602142523799144121.gal : 6 ms
[2026-05-26 18:46:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9151088057330772519.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/ReachabilityCardinality11602142523799144121.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9151088057330772519.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9151088057330772519.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 12
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :12 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 29
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :29 after 87
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :87 after 187
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :187 after 342
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :342 after 692
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :692 after 3688
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3688 after 8243
Interrupted probabilistic random walk after 978726 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :0 out of 2
Probabilistic random walk after 978726 steps, saw 142395 distinct states, run finished after 3001 ms. (steps per millisecond=326 ) properties seen :0
[2026-05-26 18:46:16] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:46:16] [INFO ] Invariant cache hit.
[2026-05-26 18:46:16] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 194/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 108/668 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/668 variables, 108/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/668 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/672 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/672 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/672 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 27/699 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/699 variables, 27/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/699 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/700 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/700 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/700 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 110/810 variables, 140/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 739 constraints, problems are : Problem set: 0 solved, 2 unsolved in 379 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/285 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 30/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/560 variables, 50/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 50/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 194/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8243 after 35144
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 108/668 variables, 4/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/668 variables, 108/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/668 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/668 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/672 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/672 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/672 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 27/699 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/699 variables, 27/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/699 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/700 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1145 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1528ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 259/259 places, 671/671 transitions.
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :35144 after 92771
Interrupted probabilistic random walk after 967897 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 2
Probabilistic random walk after 967897 steps, saw 141012 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
[2026-05-26 18:46:21] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:46:21] [INFO ] Invariant cache hit.
[2026-05-26 18:46:21] [INFO ] State equation strengthened by 204 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 155/285 variables, 30/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 30/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 275/560 variables, 50/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 50/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 194/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 108/668 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/668 variables, 108/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/668 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 4/672 variables, 4/565 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/672 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/672 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 27/699 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/699 variables, 27/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/699 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/700 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/700 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/700 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 110/810 variables, 140/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 0/810 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 810/810 variables, and 739 constraints, problems are : Problem set: 0 solved, 2 unsolved in 398 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 37/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 91/130 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 155/285 variables, 30/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 30/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 275/560 variables, 50/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/560 variables, 50/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/560 variables, 194/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/560 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 108/668 variables, 4/455 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/668 variables, 108/563 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/668 variables, 4/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/668 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 4/672 variables, 4/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/672 variables, 4/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/672 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 27/699 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/699 variables, 27/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/699 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 1/700 variables, 1/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/700 variables, 1/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/700 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (OVERLAPS) 110/810 variables, 140/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/810 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 810/810 variables, and 745 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1139 ms.
Refiners :[Domain max(s): 259/259 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 259/259 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1542ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 8 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2026-05-26 18:46:22] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:46:22] [INFO ] Invariant cache hit.
[2026-05-26 18:46:22] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-26 18:46:22] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
[2026-05-26 18:46:22] [INFO ] Invariant cache hit.
[2026-05-26 18:46:23] [INFO ] State equation strengthened by 204 read => feed constraints.
[2026-05-26 18:46:23] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2026-05-26 18:46:23] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 259/259 places, 671/671 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 508 edges and 259 vertex of which 179 / 259 are part of one of the 30 SCC in 1 ms
Free SCC test removed 149 places
Drop transitions (Empty/Sink Transition effects.) removed 298 transitions
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 447 transitions.
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 29 Pre rules applied. Total rules applied 1 place count 110 transition count 195
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 81 transition count 195
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 79 place count 68 transition count 193
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 91 place count 62 transition count 187
Graph (trivial) has 31 edges and 62 vertex of which 30 / 62 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 97 place count 33 transition count 187
Drop transitions (Empty/Sink Transition effects.) removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Graph (complete) has 162 edges and 33 vertex of which 9 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 100 output transitions
Drop transitions (Output transitions of discarded places.) removed 100 transitions
Graph (trivial) has 46 edges and 9 vertex of which 5 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 0 with 32 rules applied. Total rules applied 129 place count 5 transition count 57
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 181 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 184 place count 3 transition count 4
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 186 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 186 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 2 transition count 1
Applied a total of 188 rules in 8 ms. Remains 2 /259 variables (removed 257) and now considering 1/671 (removed 670) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17532530967132405480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15921230111608997606.kers'
[2026-05-26 18:46:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17532530967132405480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15921230111608997606.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 14 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-26 18:46:23] [INFO ] Computed 1 invariants in 16 ms
Computed 1 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-15921230111608997606.kers
Total runtime 16 ms.
[2026-05-26 18:46:23] [INFO ] [Real]Absence check using 1 positive place invariants in 30 ms returned sat
[2026-05-26 18:46:23] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-26 18:46:23] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
[2026-05-26 18:46:23] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
[2026-05-26 18:46:23] [INFO ] Flatten gal took : 2 ms
[2026-05-26 18:46:23] [INFO ] Flatten gal took : 0 ms
[2026-05-26 18:46:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3628095541555976032.gal : 0 ms
[2026-05-26 18:46:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6052389624959767690.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3628095541555976032.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6052389624959767690.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/ReachabilityCardinality6052389624959767690.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2,0.002218,4148,2,4,5,11,8,0,10,6,0
Total reachable state count : 2
Verifying 2 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.002349,4152,2,3,6,11,8,0,12,6,0
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.00245,4156,2,3,6,11,8,0,12,6,0
Over-approximation ignoring read arcs solved 0 properties in 261 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-26 18:46:24] [INFO ] Flatten gal took : 21 ms
[2026-05-26 18:46:24] [INFO ] Applying decomposition
[2026-05-26 18:46:24] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12998441913145932987.txt' '-o' '/tmp/graph12998441913145932987.bin' '-w' '/tmp/graph12998441913145932987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12998441913145932987.bin' '-l' '-1' '-v' '-w' '/tmp/graph12998441913145932987.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:46:24] [INFO ] Decomposing Gal with order
[2026-05-26 18:46:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:46:24] [INFO ] Removed a total of 910 redundant transitions.
[2026-05-26 18:46:24] [INFO ] Flatten gal took : 73 ms
[2026-05-26 18:46:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 250 labels/synchronizations in 14 ms.
[2026-05-26 18:46:24] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2059386824413864755.gal : 5 ms
[2026-05-26 18:46:24] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9913294899759527507.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2059386824413864755.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9913294899759527507.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9913294899759527507.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 246
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :246 after 258
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :258 after 262
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :771630 after 773638
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :773638 after 1.19006e+06
Detected timeout of ITS tools.
Ending property specific reduction for Peterson-PT-5-UpperBounds-12 in 127442 ms.
[2026-05-26 18:47:14] [INFO ] Flatten gal took : 28 ms
[2026-05-26 18:47:14] [INFO ] Applying decomposition
[2026-05-26 18:47:14] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6401395495523131004.txt' '-o' '/tmp/graph6401395495523131004.bin' '-w' '/tmp/graph6401395495523131004.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6401395495523131004.bin' '-l' '-1' '-v' '-w' '/tmp/graph6401395495523131004.weights' '-q' '0' '-e' '0.001'
[2026-05-26 18:47:14] [INFO ] Decomposing Gal with order
[2026-05-26 18:47:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 18:47:14] [INFO ] Removed a total of 916 redundant transitions.
[2026-05-26 18:47:14] [INFO ] Flatten gal took : 35 ms
[2026-05-26 18:47:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 14 ms.
[2026-05-26 18:47:14] [INFO ] Time to serialize gal into /tmp/UpperBounds9195113300589308345.gal : 5 ms
[2026-05-26 18:47:14] [INFO ] Time to serialize properties into /tmp/UpperBounds10201196081927944183.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/UpperBounds9195113300589308345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10201196081927944183.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds10201196081927944183.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.00765e+08,486.316,3875816,99196,1316,6.83133e+06,11061,1432,1.12313e+07,138,108541,0
Total reachable state count : 300764892
Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-5-UpperBounds-12 :0 <= i11.u0.BeginLoop_3_4_5 <= 1
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-UpperBounds-12,0,493.965,3875816,1,0,6.83133e+06,11061,1602,1.12313e+07,157,108541,1387
Total runtime 1120661 ms.
BK_STOP 1779821735514
--------------------
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="Peterson-PT-5"
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 Peterson-PT-5, 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 r194-tall-177969914300725"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 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 ;