About the Execution of ITS-Tools for FireWire-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1758.688 | 367234.00 | 561722.00 | 1268.90 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809000301.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 FireWire-PT-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000301
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 247K 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 FireWire-PT-20-UpperBounds-00
FORMULA_NAME FireWire-PT-20-UpperBounds-01
FORMULA_NAME FireWire-PT-20-UpperBounds-02
FORMULA_NAME FireWire-PT-20-UpperBounds-03
FORMULA_NAME FireWire-PT-20-UpperBounds-04
FORMULA_NAME FireWire-PT-20-UpperBounds-05
FORMULA_NAME FireWire-PT-20-UpperBounds-06
FORMULA_NAME FireWire-PT-20-UpperBounds-07
FORMULA_NAME FireWire-PT-20-UpperBounds-08
FORMULA_NAME FireWire-PT-20-UpperBounds-09
FORMULA_NAME FireWire-PT-20-UpperBounds-10
FORMULA_NAME FireWire-PT-20-UpperBounds-11
FORMULA_NAME FireWire-PT-20-UpperBounds-12
FORMULA_NAME FireWire-PT-20-UpperBounds-13
FORMULA_NAME FireWire-PT-20-UpperBounds-14
FORMULA_NAME FireWire-PT-20-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779861286664
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-27 05:54:49] [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-27 05:54:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-27 05:54:49] [INFO ] Load time of PNML (sax parser for PT used): 270 ms
[2026-05-27 05:54:49] [INFO ] Transformed 626 places.
[2026-05-27 05:54:49] [INFO ] Transformed 1031 transitions.
[2026-05-27 05:54:49] [INFO ] Found NUPN structural information;
[2026-05-27 05:54:49] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 548 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12587994131961829757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1180164281340202950.kers'
[2026-05-27 05:54:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12587994131961829757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1180164281340202950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1031 rows 626 cols 3196 entries
Finished phase 1 with 613 SingleSign rule and 0 generalized
[2026-05-27 05:54:49] [INFO ] Computed 13 invariants in 5 ms
Computed 13 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-1180164281340202950.kers
Total runtime 8 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (3 resets) in 87 ms. (113 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 110003 steps (56 resets) in 497 ms. (220 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-27 05:54:50] [INFO ] Invariant cache hit.
[2026-05-27 05:54:51] [INFO ] [Real]Absence check using 13 positive place invariants in 29 ms returned sat
[2026-05-27 05:54:52] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2026-05-27 05:54:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:54:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 40 ms returned sat
[2026-05-27 05:54:54] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2026-05-27 05:54:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-27 05:54:59] [INFO ] [Real]Absence check using 13 positive place invariants in 35 ms returned sat
[2026-05-27 05:54:59] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2026-05-27 05:55:00] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 165 ms.
[2026-05-27 05:55:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 38 ms returned sat
[2026-05-27 05:55:01] [INFO ] [Nat]Absence check using state equation in 624 ms returned sat
[2026-05-27 05:55:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1893 ms
[2026-05-27 05:55:03] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 154 ms.
[2026-05-27 05:55:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.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-27 05:55:05] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:55:06] [INFO ] [Real]Absence check using state equation in 730 ms returned sat
[2026-05-27 05:55:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 36 ms returned sat
[2026-05-27 05:55:08] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2026-05-27 05:55:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1016 ms
[2026-05-27 05:55:09] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 130 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2026-05-27 05:55:12] [INFO ] [Real]Absence check using 13 positive place invariants in 35 ms returned sat
[2026-05-27 05:55:13] [INFO ] [Real]Absence check using state equation in 611 ms returned sat
[2026-05-27 05:55:14] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 38 ms returned sat
[2026-05-27 05:55:15] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2026-05-27 05:55:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1592 ms
[2026-05-27 05:55:16] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 128 ms.
[2026-05-27 05:55:19] [INFO ] Added : 110 causal constraints over 22 iterations in 2475 ms. Result :unknown
[2026-05-27 05:55:19] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:55:20] [INFO ] [Real]Absence check using state equation in 688 ms returned sat
[2026-05-27 05:55:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 36 ms returned sat
[2026-05-27 05:55:22] [INFO ] [Nat]Absence check using state equation in 620 ms returned sat
[2026-05-27 05:55:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 863 ms
[2026-05-27 05:55:23] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 127 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-27 05:55:26] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:55:27] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2026-05-27 05:55:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:28] [INFO ] [Nat]Absence check using 13 positive place invariants in 35 ms returned sat
[2026-05-27 05:55:29] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2026-05-27 05:55:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1299 ms
[2026-05-27 05:55:30] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 75 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2026-05-27 05:55:33] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2026-05-27 05:55:33] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2026-05-27 05:55:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 39 ms returned sat
[2026-05-27 05:55:35] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2026-05-27 05:55:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1937 ms
[2026-05-27 05:55:37] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 107 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-27 05:55:40] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:55:40] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2026-05-27 05:55:41] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 32 ms returned sat
[2026-05-27 05:55:42] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2026-05-27 05:55:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1865 ms
[2026-05-27 05:55:44] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 107 ms.
[2026-05-27 05:55:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
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-27 05:55:47] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:55:47] [INFO ] [Real]Absence check using state equation in 629 ms returned sat
[2026-05-27 05:55:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2026-05-27 05:55:49] [INFO ] [Nat]Absence check using state equation in 627 ms returned sat
[2026-05-27 05:55:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2227 ms
[2026-05-27 05:55:51] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 108 ms.
[2026-05-27 05:55:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
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-27 05:55:53] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:55:54] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2026-05-27 05:55:55] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:55:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 35 ms returned sat
[2026-05-27 05:55:56] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2026-05-27 05:55:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1771 ms
[2026-05-27 05:55:58] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 70 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-27 05:56:00] [INFO ] [Real]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-27 05:56:01] [INFO ] [Real]Absence check using state equation in 627 ms returned sat
[2026-05-27 05:56:02] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 36 ms returned sat
[2026-05-27 05:56:03] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2026-05-27 05:56:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 661 ms
[2026-05-27 05:56:04] [INFO ] Computed and/alt/rep : 839/2158/839 causal constraints (skipped 191 transitions) in 72 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_GUIDED_WALK
Support contains 10 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Graph (trivial) has 445 edges and 626 vertex of which 12 / 626 are part of one of the 3 SCC in 21 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1871 edges and 617 vertex of which 602 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.8 ms
Discarding 15 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 602 transition count 899
Reduce places removed 116 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 239 place count 486 transition count 897
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 242 place count 485 transition count 895
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 244 place count 483 transition count 895
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 244 place count 483 transition count 879
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 276 place count 467 transition count 879
Discarding 87 places :
Symmetric choice reduction at 4 with 87 rule applications. Total rules 363 place count 380 transition count 787
Iterating global reduction 4 with 87 rules applied. Total rules applied 450 place count 380 transition count 787
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 453 place count 380 transition count 784
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 453 place count 380 transition count 775
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 471 place count 371 transition count 775
Discarding 28 places :
Symmetric choice reduction at 5 with 28 rule applications. Total rules 499 place count 343 transition count 648
Iterating global reduction 5 with 28 rules applied. Total rules applied 527 place count 343 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 529 place count 343 transition count 646
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 537 place count 335 transition count 632
Iterating global reduction 6 with 8 rules applied. Total rules applied 545 place count 335 transition count 632
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 549 place count 335 transition count 628
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 551 place count 333 transition count 628
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 554 place count 330 transition count 619
Iterating global reduction 8 with 3 rules applied. Total rules applied 557 place count 330 transition count 619
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 560 place count 327 transition count 613
Iterating global reduction 8 with 3 rules applied. Total rules applied 563 place count 327 transition count 613
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 566 place count 324 transition count 604
Iterating global reduction 8 with 3 rules applied. Total rules applied 569 place count 324 transition count 604
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 572 place count 321 transition count 598
Iterating global reduction 8 with 3 rules applied. Total rules applied 575 place count 321 transition count 598
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 578 place count 318 transition count 589
Iterating global reduction 8 with 3 rules applied. Total rules applied 581 place count 318 transition count 589
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 584 place count 315 transition count 583
Iterating global reduction 8 with 3 rules applied. Total rules applied 587 place count 315 transition count 583
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 590 place count 312 transition count 574
Iterating global reduction 8 with 3 rules applied. Total rules applied 593 place count 312 transition count 574
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 595 place count 310 transition count 570
Iterating global reduction 8 with 2 rules applied. Total rules applied 597 place count 310 transition count 570
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 599 place count 308 transition count 564
Iterating global reduction 8 with 2 rules applied. Total rules applied 601 place count 308 transition count 564
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 603 place count 306 transition count 560
Iterating global reduction 8 with 2 rules applied. Total rules applied 605 place count 306 transition count 560
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 607 place count 304 transition count 556
Iterating global reduction 8 with 2 rules applied. Total rules applied 609 place count 304 transition count 556
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 611 place count 302 transition count 552
Iterating global reduction 8 with 2 rules applied. Total rules applied 613 place count 302 transition count 552
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 8 with 92 rules applied. Total rules applied 705 place count 256 transition count 506
Performed 42 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 8 with 84 rules applied. Total rules applied 789 place count 214 transition count 590
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 792 place count 214 transition count 587
Free-agglomeration rule applied 25 times.
Iterating global reduction 8 with 25 rules applied. Total rules applied 817 place count 214 transition count 562
Reduce places removed 25 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 33 rules applied. Total rules applied 850 place count 189 transition count 554
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 856 place count 183 transition count 548
Iterating global reduction 9 with 6 rules applied. Total rules applied 862 place count 183 transition count 548
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 871 place count 183 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 895 place count 183 transition count 515
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 896 place count 183 transition count 515
Applied a total of 896 rules in 816 ms. Remains 183 /626 variables (removed 443) and now considering 515/1031 (removed 516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 833 ms. Remains : 183/626 places, 515/1031 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14528693412717366887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13832611356755259085.kers'
[2026-05-27 05:56:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14528693412717366887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13832611356755259085.kers]
Normalized transition count is 506 out of 515 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 506 rows 183 cols 1863 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-27 05:56:08] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13832611356755259085.kers
Total runtime 7 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (33163 resets) in 2746 ms. (364 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-20-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000002 steps (19596 resets) in 2083 ms. (1439 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-27 05:56:13] [INFO ] Flow matrix only has 506 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7775059482506591565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12301938709268208767.kers'
[2026-05-27 05:56:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7775059482506591565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12301938709268208767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 506 rows 183 cols 1863 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-27 05:56:13] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12301938709268208767.kers
Total runtime 3 ms.
[2026-05-27 05:56:13] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 05:56:13] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-27 05:56:13] [INFO ] State equation strengthened by 90 read => feed constraints.
[2026-05-27 05:56:13] [INFO ] [Real]Added 90 Read/Feed constraints in 23 ms returned sat
[2026-05-27 05:56:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-27 05:56:14] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2026-05-27 05:56:14] [INFO ] [Nat]Added 90 Read/Feed constraints in 235 ms returned sat
[2026-05-27 05:56:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2026-05-27 05:56:14] [INFO ] Computed and/alt/rep : 158/683/158 causal constraints (skipped 340 transitions) in 57 ms.
[2026-05-27 05:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 701 ms
[2026-05-27 05:56:16] [INFO ] Added : 18 causal constraints over 5 iterations in 1293 ms. Result :sat
Minimization took 439 ms.
[2026-05-27 05:56:16] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-27 05:56:16] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2026-05-27 05:56:16] [INFO ] [Real]Added 90 Read/Feed constraints in 38 ms returned sat
[2026-05-27 05:56:16] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-27 05:56:17] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2026-05-27 05:56:17] [INFO ] [Nat]Added 90 Read/Feed constraints in 197 ms returned sat
[2026-05-27 05:56:17] [INFO ] Computed and/alt/rep : 158/683/158 causal constraints (skipped 340 transitions) in 55 ms.
[2026-05-27 05:56:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 935 ms
[2026-05-27 05:56:19] [INFO ] Added : 21 causal constraints over 5 iterations in 1734 ms. Result :sat
Minimization took 699 ms.
[2026-05-27 05:56:19] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 05:56:20] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2026-05-27 05:56:20] [INFO ] [Real]Added 90 Read/Feed constraints in 56 ms returned sat
[2026-05-27 05:56:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 05:56:20] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2026-05-27 05:56:20] [INFO ] [Nat]Added 90 Read/Feed constraints in 43 ms returned sat
[2026-05-27 05:56:20] [INFO ] Computed and/alt/rep : 158/683/158 causal constraints (skipped 340 transitions) in 66 ms.
[2026-05-27 05:56:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2026-05-27 05:56:21] [INFO ] Added : 43 causal constraints over 9 iterations in 851 ms. Result :sat
Minimization took 593 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 515/515 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 183 transition count 514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 182 transition count 514
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 182 transition count 513
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 4 place count 181 transition count 513
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 180 transition count 512
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 180 transition count 512
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 178 transition count 510
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 176 transition count 512
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 176 transition count 509
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 176 transition count 507
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 24 place count 174 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 174 transition count 503
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 174 transition count 503
Applied a total of 26 rules in 81 ms. Remains 174 /183 variables (removed 9) and now considering 503/515 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 174/183 places, 503/515 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13473324886322574437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15831147054791702146.kers'
[2026-05-27 05:56:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13473324886322574437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15831147054791702146.kers]
Normalized transition count is 494 out of 503 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 494 rows 174 cols 1843 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-27 05:56:22] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-15831147054791702146.kers
Total runtime 13 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (33207 resets) in 2280 ms. (438 steps per ms)
FORMULA FireWire-PT-20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (12978 resets) in 1199 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-27 05:56:25] [INFO ] Flow matrix only has 494 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3752574836238907537.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4008514470618498770.kers'
[2026-05-27 05:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3752574836238907537.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4008514470618498770.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 494 rows 174 cols 1843 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-27 05:56:25] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4008514470618498770.kers
Total runtime 2 ms.
[2026-05-27 05:56:25] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-27 05:56:25] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2026-05-27 05:56:25] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-27 05:56:25] [INFO ] [Real]Added 87 Read/Feed constraints in 18 ms returned sat
[2026-05-27 05:56:25] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-27 05:56:26] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2026-05-27 05:56:26] [INFO ] [Nat]Added 87 Read/Feed constraints in 277 ms returned sat
[2026-05-27 05:56:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2026-05-27 05:56:26] [INFO ] Computed and/alt/rep : 147/671/147 causal constraints (skipped 339 transitions) in 66 ms.
[2026-05-27 05:56:27] [INFO ] Added : 18 causal constraints over 4 iterations in 642 ms. Result :sat
Minimization took 393 ms.
[2026-05-27 05:56:27] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-27 05:56:27] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2026-05-27 05:56:27] [INFO ] [Real]Added 87 Read/Feed constraints in 54 ms returned sat
[2026-05-27 05:56:27] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2026-05-27 05:56:28] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2026-05-27 05:56:28] [INFO ] [Nat]Added 87 Read/Feed constraints in 43 ms returned sat
[2026-05-27 05:56:28] [INFO ] Computed and/alt/rep : 147/671/147 causal constraints (skipped 339 transitions) in 47 ms.
[2026-05-27 05:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 233 ms
[2026-05-27 05:56:28] [INFO ] Added : 21 causal constraints over 5 iterations in 502 ms. Result :sat
Minimization took 374 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 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 503/503 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 173 transition count 502
Applied a total of 2 rules in 16 ms. Remains 173 /174 variables (removed 1) and now considering 502/503 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 173/174 places, 502/503 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7801619301163721864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11328283117763454690.kers'
[2026-05-27 05:56:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7801619301163721864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11328283117763454690.kers]
Normalized transition count is 493 out of 502 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 493 rows 173 cols 1841 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-27 05:56:29] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11328283117763454690.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 (33208 resets) in 2406 ms. (415 steps per ms)
BEST_FIRST walk for 2000002 steps (12901 resets) in 1226 ms. (1629 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-27 05:56:32] [INFO ] Flow matrix only has 493 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15552675578306957086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-982270953047926269.kers'
[2026-05-27 05:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15552675578306957086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-982270953047926269.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 493 rows 173 cols 1841 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-27 05:56:32] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-982270953047926269.kers
Total runtime 4 ms.
[2026-05-27 05:56:32] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-27 05:56:33] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2026-05-27 05:56:33] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-27 05:56:33] [INFO ] [Real]Added 87 Read/Feed constraints in 27 ms returned sat
[2026-05-27 05:56:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-27 05:56:33] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2026-05-27 05:56:33] [INFO ] [Nat]Added 87 Read/Feed constraints in 273 ms returned sat
[2026-05-27 05:56:33] [INFO ] Computed and/alt/rep : 146/670/146 causal constraints (skipped 339 transitions) in 50 ms.
[2026-05-27 05:56:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2026-05-27 05:56:35] [INFO ] Added : 26 causal constraints over 6 iterations in 1391 ms. Result :sat
Minimization took 591 ms.
[2026-05-27 05:56:35] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-27 05:56:35] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2026-05-27 05:56:36] [INFO ] [Real]Added 87 Read/Feed constraints in 76 ms returned sat
[2026-05-27 05:56:36] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:56:36] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-27 05:56:36] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2026-05-27 05:56:36] [INFO ] [Nat]Added 87 Read/Feed constraints in 68 ms returned sat
[2026-05-27 05:56:36] [INFO ] Computed and/alt/rep : 146/670/146 causal constraints (skipped 339 transitions) in 58 ms.
[2026-05-27 05:56:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 410 ms
[2026-05-27 05:56:37] [INFO ] Added : 25 causal constraints over 6 iterations in 790 ms. Result :sat
Minimization took 571 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 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 502/502 transitions.
Applied a total of 0 rules in 10 ms. Remains 173 /173 variables (removed 0) and now considering 502/502 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 173/173 places, 502/502 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 502/502 transitions.
Applied a total of 0 rules in 10 ms. Remains 173 /173 variables (removed 0) and now considering 502/502 (removed 0) transitions.
[2026-05-27 05:56:37] [INFO ] Flow matrix only has 493 transitions (discarded 9 similar events)
[2026-05-27 05:56:37] [INFO ] Invariant cache hit.
[2026-05-27 05:56:38] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-27 05:56:38] [INFO ] Flow matrix only has 493 transitions (discarded 9 similar events)
[2026-05-27 05:56:38] [INFO ] Invariant cache hit.
[2026-05-27 05:56:38] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-27 05:56:38] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2026-05-27 05:56:38] [INFO ] Redundant transitions in 47 ms returned []
Running 494 sub problems to find dead transitions.
[2026-05-27 05:56:39] [INFO ] Flow matrix only has 493 transitions (discarded 9 similar events)
[2026-05-27 05:56:39] [INFO ] Invariant cache hit.
[2026-05-27 05:56:39] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (OVERLAPS) 493/666 variables, 173/192 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 87/279 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 279 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 494 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 5 (OVERLAPS) 493/666 variables, 173/193 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/666 variables, 87/280 constraints. Problems are: Problem set: 0 solved, 494 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/666 variables, 494/774 constraints. Problems are: Problem set: 0 solved, 494 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 666/666 variables, and 774 constraints, problems are : Problem set: 0 solved, 494 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 494/494 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60677ms problems are : Problem set: 0 solved, 494 unsolved
Search for dead transitions found 0 dead transitions in 60697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61822 ms. Remains : 173/173 places, 502/502 transitions.
RANDOM walk for 40000 steps (1324 resets) in 1164 ms. (34 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (249 resets) in 356 ms. (112 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (244 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (270 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (259 resets) in 276 ms. (144 steps per ms) remains 4/4 properties
[2026-05-27 05:57:40] [INFO ] Flatten gal took : 354 ms
[2026-05-27 05:57:40] [INFO ] Flatten gal took : 152 ms
[2026-05-27 05:57:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2260016361879955922.gal : 46 ms
[2026-05-27 05:57:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9073843754040302475.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/ReachabilityCardinality2260016361879955922.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9073843754040302475.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/ReachabilityCardinality9073843754040302475.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 36
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :36 after 37
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :37 after 42
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :42 after 57
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :57 after 87
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :87 after 366
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :366 after 1617
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1617 after 2607
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2607 after 7935
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7935 after 48364
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :48364 after 68693
Interrupted probabilistic random walk after 316550 steps, run timeout after 3001 ms. (steps per millisecond=105 ) properties seen :0 out of 4
Probabilistic random walk after 316550 steps, saw 92350 distinct states, run finished after 3006 ms. (steps per millisecond=105 ) properties seen :0
[2026-05-27 05:57:43] [INFO ] Flow matrix only has 493 transitions (discarded 9 similar events)
[2026-05-27 05:57:43] [INFO ] Invariant cache hit.
[2026-05-27 05:57:43] [INFO ] State equation strengthened by 87 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 155/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 493/654 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 87/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/666 variables, 12/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/666 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/666 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 271 constraints, problems are : Problem set: 0 solved, 2 unsolved in 543 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 155/161 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 493/654 variables, 161/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/654 variables, 87/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/666 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 273 constraints, problems are : Problem set: 0 solved, 2 unsolved in 597 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 87/87 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1148ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 1 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 502/502 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 172 transition count 500
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 172 transition count 500
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 171 transition count 497
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 171 transition count 497
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 170 transition count 495
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 170 transition count 495
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 169 transition count 493
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 169 transition count 493
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 168 transition count 491
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 168 transition count 491
Applied a total of 10 rules in 23 ms. Remains 168 /173 variables (removed 5) and now considering 491/502 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 168/173 places, 491/502 transitions.
RANDOM walk for 40000 steps (1303 resets) in 325 ms. (122 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (257 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (246 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :68693 after 182221
Interrupted probabilistic random walk after 485026 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :0 out of 2
Probabilistic random walk after 485026 steps, saw 139778 distinct states, run finished after 3001 ms. (steps per millisecond=161 ) properties seen :0
[2026-05-27 05:57:47] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1583038721988980104.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10496773497080723470.kers'
[2026-05-27 05:57:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1583038721988980104.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10496773497080723470.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 482 rows 168 cols 1799 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-27 05:57:47] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10496773497080723470.kers
Total runtime 3 ms.
[2026-05-27 05:57:47] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 482/638 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/638 variables, 86/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/650 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/650 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/650 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 265 constraints, problems are : Problem set: 0 solved, 2 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 482/638 variables, 156/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/638 variables, 86/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/638 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :182221 after 376350
At refinement iteration 10 (INCLUDED_ONLY) 0/638 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/650 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/650 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 491/491 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 491/491 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 168/168 places, 491/491 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 491/491 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 491/491 (removed 0) transitions.
[2026-05-27 05:57:49] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2026-05-27 05:57:49] [INFO ] Invariant cache hit.
[2026-05-27 05:57:49] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-27 05:57:49] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2026-05-27 05:57:49] [INFO ] Invariant cache hit.
[2026-05-27 05:57:49] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-27 05:57:50] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
[2026-05-27 05:57:50] [INFO ] Redundant transitions in 25 ms returned []
Running 483 sub problems to find dead transitions.
[2026-05-27 05:57:50] [INFO ] Flow matrix only has 482 transitions (discarded 9 similar events)
[2026-05-27 05:57:50] [INFO ] Invariant cache hit.
[2026-05-27 05:57:50] [INFO ] State equation strengthened by 86 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :376350 after 913471
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 482/650 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 483 unsolved
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :913471 after 1.96539e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 86/272 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 650/650 variables, and 272 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 483 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 1 (OVERLAPS) 1/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 483 unsolved
At refinement iteration 4 (OVERLAPS) 482/650 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Detected timeout of ITS tools.
[2026-05-27 05:58:30] [INFO ] Flatten gal took : 67 ms
[2026-05-27 05:58:30] [INFO ] Applying decomposition
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 86/272 constraints. Problems are: Problem set: 0 solved, 483 unsolved
[2026-05-27 05:58:31] [INFO ] Flatten gal took : 61 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/graph8111530214589573178.txt' '-o' '/tmp/graph8111530214589573178.bin' '-w' '/tmp/graph8111530214589573178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8111530214589573178.bin' '-l' '-1' '-v' '-w' '/tmp/graph8111530214589573178.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:58:31] [INFO ] Decomposing Gal with order
[2026-05-27 05:58:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:58:31] [INFO ] Removed a total of 771 redundant transitions.
[2026-05-27 05:58:31] [INFO ] Flatten gal took : 204 ms
[2026-05-27 05:58:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 49 ms.
[2026-05-27 05:58:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8351408004268313683.gal : 19 ms
[2026-05-27 05:58:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12480194122747566973.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/ReachabilityCardinality8351408004268313683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12480194122747566973.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/ReachabilityCardinality12480194122747566973.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :129 after 385
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :385 after 513
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :513 after 29569
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :29569 after 59009
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :59009 after 550145
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :550145 after 1.43742e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 483/755 constraints. Problems are: Problem set: 0 solved, 483 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/650 variables, and 755 constraints, problems are : Problem set: 0 solved, 483 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 483/483 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60605ms problems are : Problem set: 0 solved, 483 unsolved
Search for dead transitions found 0 dead transitions in 60614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61623 ms. Remains : 168/168 places, 491/491 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 168 vertex of which 31 / 168 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 166 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 139 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 139 transition count 322
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 20 place count 139 transition count 309
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 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 138 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 46 place count 138 transition count 284
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 138 transition count 279
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 133 transition count 277
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 133 transition count 275
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 131 transition count 275
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 130 transition count 274
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 130 transition count 271
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 129 transition count 270
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 128 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 128 transition count 237
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 128 transition count 233
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 80 place count 124 transition count 232
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 124 transition count 228
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 124 transition count 226
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 122 transition count 226
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 94 place count 122 transition count 226
Applied a total of 94 rules in 114 ms. Remains 122 /168 variables (removed 46) and now considering 226/491 (removed 265) transitions.
Running SMT prover for 2 properties.
[2026-05-27 05:58:50] [INFO ] Flow matrix only has 222 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-470511307448334427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16253177029781267889.kers'
[2026-05-27 05:58:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-470511307448334427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16253177029781267889.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 122 cols 899 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-27 05:58:50] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16253177029781267889.kers
Total runtime 3 ms.
[2026-05-27 05:58:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 05:58:51] [INFO ] After 250ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 05:58:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 05:58:51] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-27 05:58:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-27 05:58:51] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 05:58:51] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 05:58:51] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-27 05:58:51] [INFO ] Flatten gal took : 34 ms
[2026-05-27 05:58:51] [INFO ] Flatten gal took : 31 ms
[2026-05-27 05:58:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10222110573796010581.gal : 4 ms
[2026-05-27 05:58:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality554311607140063416.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/ReachabilityCardinality10222110573796010581.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality554311607140063416.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/ReachabilityCardinality554311607140063416.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 199
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :199 after 255
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :255 after 281
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :281 after 1303
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1303 after 2035
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2035 after 3114
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3114 after 6558
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6558 after 13790
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13790 after 25475
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :25475 after 295901
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1.43742e+07 after 6.72633e+08
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :295901 after 872097
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :872097 after 3.38196e+06
Detected timeout of ITS tools.
[2026-05-27 05:59:06] [INFO ] Flatten gal took : 15 ms
[2026-05-27 05:59:06] [INFO ] Applying decomposition
[2026-05-27 05:59:06] [INFO ] Flatten gal took : 14 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/graph9450260263815300406.txt' '-o' '/tmp/graph9450260263815300406.bin' '-w' '/tmp/graph9450260263815300406.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9450260263815300406.bin' '-l' '-1' '-v' '-w' '/tmp/graph9450260263815300406.weights' '-q' '0' '-e' '0.001'
[2026-05-27 05:59:06] [INFO ] Decomposing Gal with order
[2026-05-27 05:59:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 05:59:06] [INFO ] Removed a total of 328 redundant transitions.
[2026-05-27 05:59:06] [INFO ] Flatten gal took : 52 ms
[2026-05-27 05:59:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 12 ms.
[2026-05-27 05:59:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16425780791027154908.gal : 14 ms
[2026-05-27 05:59:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality59113103524853070.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/ReachabilityCardinality16425780791027154908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality59113103524853070.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 ...306
Loading property file /tmp/ReachabilityCardinality59113103524853070.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :25 after 49
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :49 after 10969
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :10969 after 15649
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15649 after 3.10894e+08
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.27481e+09,1.16911,28676,690,118,42279,1236,509,99226,98,4963,0
Total reachable state count : 4274807689
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,4.20607e+06,1.17085,28684,100,60,42279,1236,512,99226,101,4963,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,4.20607e+06,1.17135,28936,100,60,42279,1236,518,99226,103,4963,0
Over-approximation ignoring read arcs solved 0 properties in 17299 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-20-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : 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-13801617912637500948.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2201172497874042699.kers'
[2026-05-27 05:59:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13801617912637500948.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2201172497874042699.kers]
Normalized transition count is 493 out of 502 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 493 rows 173 cols 1841 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-27 05:59:08] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2201172497874042699.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33198 resets) in 3115 ms. (320 steps per ms)
BEST_FIRST walk for 1000001 steps (6506 resets) in 929 ms. (1075 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-27 05:59:12] [INFO ] Flow matrix only has 493 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12088691280209653994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13721484920723387875.kers'
[2026-05-27 05:59:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12088691280209653994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13721484920723387875.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 493 rows 173 cols 1841 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-27 05:59:12] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13721484920723387875.kers
Total runtime 6 ms.
[2026-05-27 05:59:12] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-27 05:59:12] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2026-05-27 05:59:12] [INFO ] State equation strengthened by 87 read => feed constraints.
[2026-05-27 05:59:12] [INFO ] [Real]Added 87 Read/Feed constraints in 30 ms returned sat
[2026-05-27 05:59:12] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:59:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2026-05-27 05:59:12] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2026-05-27 05:59:13] [INFO ] [Nat]Added 87 Read/Feed constraints in 286 ms returned sat
[2026-05-27 05:59:13] [INFO ] Computed and/alt/rep : 146/670/146 causal constraints (skipped 339 transitions) in 75 ms.
[2026-05-27 05:59:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 775 ms
[2026-05-27 05:59:14] [INFO ] Added : 26 causal constraints over 6 iterations in 1639 ms. Result :sat
Minimization took 568 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 173 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p467) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 501/501 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 172 transition count 499
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 172 transition count 499
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 171 transition count 496
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 171 transition count 496
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 170 transition count 494
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 170 transition count 494
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 169 transition count 492
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 169 transition count 492
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 168 transition count 490
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 168 transition count 490
Applied a total of 10 rules in 18 ms. Remains 168 /173 variables (removed 5) and now considering 490/501 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 168/173 places, 490/501 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6313504626789079496.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8901771277576408387.kers'
[2026-05-27 05:59:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6313504626789079496.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8901771277576408387.kers]
Normalized transition count is 481 out of 490 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 168 cols 1797 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-27 05:59:15] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8901771277576408387.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (33163 resets) in 2921 ms. (342 steps per ms)
BEST_FIRST walk for 1000000 steps (6461 resets) in 781 ms. (1278 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-27 05:59:19] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10063785281827089727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17801092957830737617.kers'
[2026-05-27 05:59:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10063785281827089727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17801092957830737617.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 168 cols 1797 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-27 05:59:19] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17801092957830737617.kers
Total runtime 3 ms.
[2026-05-27 05:59:19] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-27 05:59:19] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-27 05:59:19] [INFO ] Solution in real domain found non-integer solution.
[2026-05-27 05:59:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2026-05-27 05:59:19] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2026-05-27 05:59:19] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-27 05:59:19] [INFO ] [Nat]Added 86 Read/Feed constraints in 134 ms returned sat
[2026-05-27 05:59:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2026-05-27 05:59:20] [INFO ] Computed and/alt/rep : 142/656/142 causal constraints (skipped 331 transitions) in 60 ms.
[2026-05-27 05:59:20] [INFO ] Added : 20 causal constraints over 4 iterations in 525 ms. Result :sat
Minimization took 630 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 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 490/490 transitions.
Applied a total of 0 rules in 9 ms. Remains 168 /168 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 168/168 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-27 05:59:21] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 05:59:21] [INFO ] Invariant cache hit.
[2026-05-27 05:59:21] [INFO ] Implicit Places using invariants in 291 ms returned []
[2026-05-27 05:59:21] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 05:59:21] [INFO ] Invariant cache hit.
[2026-05-27 05:59:21] [INFO ] State equation strengthened by 86 read => feed constraints.
[2026-05-27 05:59:22] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2026-05-27 05:59:22] [INFO ] Redundant transitions in 11 ms returned []
Running 482 sub problems to find dead transitions.
[2026-05-27 05:59:22] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 05:59:22] [INFO ] Invariant cache hit.
[2026-05-27 05:59:22] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 2/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (OVERLAPS) 481/649 variables, 168/185 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/649 variables, 86/271 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 271 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (OVERLAPS) 2/168 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (OVERLAPS) 481/649 variables, 168/186 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/649 variables, 86/272 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/649 variables, 482/754 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 754 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61730 ms. Remains : 168/168 places, 490/490 transitions.
[2026-05-27 06:00:23] [INFO ] Flatten gal took : 23 ms
[2026-05-27 06:00:23] [INFO ] Flatten gal took : 31 ms
[2026-05-27 06:00:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12743662465179831096.gal : 6 ms
[2026-05-27 06:00:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13182511382535260841.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/ReachabilityCardinality12743662465179831096.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13182511382535260841.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
RANDOM walk for 40000 steps (1315 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (250 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (274 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality13182511382535260841.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 11
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :11 after 67
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :67 after 139
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :139 after 247
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :247 after 341
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :341 after 2626
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2626 after 7046
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :7046 after 11827
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :11827 after 27255
Interrupted probabilistic random walk after 442098 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 2
Probabilistic random walk after 442098 steps, saw 127867 distinct states, run finished after 3001 ms. (steps per millisecond=147 ) properties seen :0
[2026-05-27 06:00:26] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 06:00:26] [INFO ] Invariant cache hit.
[2026-05-27 06:00:26] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 481/637 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 86/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/649 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/649 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 265 constraints, problems are : Problem set: 0 solved, 2 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 481/637 variables, 156/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 86/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/649 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/649 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1219ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 168 /168 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 168/168 places, 490/490 transitions.
RANDOM walk for 40000 steps (1336 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (242 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :27255 after 68383
BEST_FIRST walk for 40003 steps (261 resets) in 68 ms. (579 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 507244 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 2
Probabilistic random walk after 507244 steps, saw 147415 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
[2026-05-27 06:00:30] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 06:00:30] [INFO ] Invariant cache hit.
[2026-05-27 06:00:30] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 481/637 variables, 156/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/637 variables, 86/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 12/649 variables, 12/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/649 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 649/649 variables, and 265 constraints, problems are : Problem set: 0 solved, 2 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 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, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 150/156 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 481/637 variables, 156/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/637 variables, 86/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/637 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/637 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 12/649 variables, 12/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/649 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/649 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 649/649 variables, and 268 constraints, problems are : Problem set: 0 solved, 2 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1350ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 490/490 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 168/168 places, 490/490 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2026-05-27 06:00:31] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 06:00:31] [INFO ] Invariant cache hit.
[2026-05-27 06:00:32] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-27 06:00:32] [INFO ] Flow matrix only has 481 transitions (discarded 9 similar events)
[2026-05-27 06:00:32] [INFO ] Invariant cache hit.
[2026-05-27 06:00:32] [INFO ] State equation strengthened by 86 read => feed constraints.
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :68383 after 155633
[2026-05-27 06:00:32] [INFO ] Implicit Places using invariants and state equation in 691 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2026-05-27 06:00:32] [INFO ] Redundant transitions in 5 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 885 ms. Remains : 168/168 places, 490/490 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 111 edges and 168 vertex of which 31 / 168 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 166 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 139 transition count 321
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 139 transition count 321
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 20 place count 139 transition count 308
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 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 138 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 46 place count 138 transition count 283
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 51 place count 138 transition count 278
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 58 place count 133 transition count 276
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 133 transition count 274
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 131 transition count 274
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 130 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 130 transition count 270
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 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 129 transition count 269
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 128 transition count 236
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 128 transition count 236
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 128 transition count 232
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 80 place count 124 transition count 231
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 124 transition count 227
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 124 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 88 place count 122 transition count 225
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 94 place count 122 transition count 225
Applied a total of 94 rules in 66 ms. Remains 122 /168 variables (removed 46) and now considering 225/490 (removed 265) transitions.
Running SMT prover for 2 properties.
[2026-05-27 06:00:32] [INFO ] Flow matrix only has 221 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4931275649196943757.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11047978894330638455.kers'
[2026-05-27 06:00:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4931275649196943757.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11047978894330638455.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 122 cols 897 entries
Finished phase 1 with 112 SingleSign rule and 0 generalized
[2026-05-27 06:00:32] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11047978894330638455.kers
Total runtime 2 ms.
[2026-05-27 06:00:32] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 06:00:33] [INFO ] After 97ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2026-05-27 06:00:33] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-27 06:00:33] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 06:00:33] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-27 06:00:33] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2026-05-27 06:00:33] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-27 06:00:33] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-27 06:00:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
TRAPS : Iteration 1
[2026-05-27 06:00:33] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-27 06:00:33] [INFO ] After 346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2026-05-27 06:00:33] [INFO ] Flatten gal took : 19 ms
[2026-05-27 06:00:33] [INFO ] Flatten gal took : 13 ms
[2026-05-27 06:00:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10372815216106239053.gal : 8 ms
[2026-05-27 06:00:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13383031847005816594.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/ReachabilityCardinality10372815216106239053.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13383031847005816594.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/ReachabilityCardinality13383031847005816594.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 17
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :17 after 23
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :23 after 199
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :199 after 255
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :255 after 281
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :281 after 1327
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1327 after 2081
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2081 after 3160
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3160 after 6593
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :6593 after 13872
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :13872 after 25637
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :25637 after 297837
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :297837 after 872125
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :872125 after 3.40206e+06
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :155633 after 756524
Detected timeout of ITS tools.
[2026-05-27 06:00:48] [INFO ] Flatten gal took : 12 ms
[2026-05-27 06:00:48] [INFO ] Applying decomposition
[2026-05-27 06:00:48] [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/graph3373065487323752565.txt' '-o' '/tmp/graph3373065487323752565.bin' '-w' '/tmp/graph3373065487323752565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3373065487323752565.bin' '-l' '-1' '-v' '-w' '/tmp/graph3373065487323752565.weights' '-q' '0' '-e' '0.001'
[2026-05-27 06:00:48] [INFO ] Decomposing Gal with order
[2026-05-27 06:00:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 06:00:48] [INFO ] Removed a total of 328 redundant transitions.
[2026-05-27 06:00:48] [INFO ] Flatten gal took : 37 ms
[2026-05-27 06:00:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 102 labels/synchronizations in 21 ms.
[2026-05-27 06:00:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7904241396312753811.gal : 9 ms
[2026-05-27 06:00:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10832036419958997285.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/ReachabilityCardinality7904241396312753811.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10832036419958997285.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/ReachabilityCardinality10832036419958997285.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :25 after 49
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 5 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,627265,0.04728,6400,221,57,705,220,554,547,94,313,0
Total reachable state count : 627265
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,648,0.047753,6400,55,32,705,220,558,547,97,313,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,648,0.047991,6400,55,32,705,220,566,547,99,313,0
ITS tools runner thread asked to quit. Dying gracefully.
Over-approximation ignoring read arcs solved 0 properties in 15950 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-27 06:00:48] [INFO ] Flatten gal took : 13 ms
[2026-05-27 06:00:48] [INFO ] Applying decomposition
[2026-05-27 06:00:48] [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/graph3929645628388135808.txt' '-o' '/tmp/graph3929645628388135808.bin' '-w' '/tmp/graph3929645628388135808.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3929645628388135808.bin' '-l' '-1' '-v' '-w' '/tmp/graph3929645628388135808.weights' '-q' '0' '-e' '0.001'
[2026-05-27 06:00:48] [INFO ] Decomposing Gal with order
[2026-05-27 06:00:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-27 06:00:48] [INFO ] Removed a total of 733 redundant transitions.
[2026-05-27 06:00:48] [INFO ] Flatten gal took : 39 ms
[2026-05-27 06:00:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 14 ms.
[2026-05-27 06:00:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6734370016341818156.gal : 6 ms
[2026-05-27 06:00:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14506142264845416489.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/ReachabilityCardinality6734370016341818156.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14506142264845416489.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/ReachabilityCardinality14506142264845416489.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 25
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :25 after 337
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :337 after 6601
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :6601 after 20041
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :20041 after 3.87264e+06
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :3.87264e+06 after 1.28969e+07
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.6319e+07,2.63388,68452,4411,554,61445,4289,955,522948,250,18657,0
Total reachable state count : 36318969
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,1280,2.63886,68452,85,51,61445,4289,958,522948,253,18657,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,1280,2.63993,68452,85,51,61445,4289,964,522948,255,18657,0
FORMULA FireWire-PT-20-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8270080440597768998.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4358654181355291679.kers'
[2026-05-27 06:00:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8270080440597768998.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4358654181355291679.kers]
Normalized transition count is 481 out of 490 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 168 cols 1797 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-27 06:00:51] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4358654181355291679.kers
Total runtime 5 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (33137 resets) in 2153 ms. (464 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 364724 ms.
BK_STOP 1779861653898
--------------------
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="FireWire-PT-20"
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 FireWire-PT-20, 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 r130-smll-177955809000301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-20.tgz
mv FireWire-PT-20 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 ;