Execution Chart

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

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r191-oct2-177969025600052.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-oct2-177969025600052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.2M
-rw-r--r-- 1 mcc users 18K Mar 7 19:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K Mar 7 19:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 19:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 19:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Mar 15 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 15 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 15 11:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Mar 7 19:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Mar 7 19:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 7 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Mar 7 19:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Mar 15 11:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Mar 15 11:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.6M 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 MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942958972

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:36:00] [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-28 04:36:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:36:01] [INFO ] Load time of PNML (sax parser for PT used): 480 ms
[2026-05-28 04:36:01] [INFO ] Transformed 4914 places.
[2026-05-28 04:36:01] [INFO ] Transformed 6913 transitions.
[2026-05-28 04:36:01] [INFO ] Parsed PT model containing 4914 places and 6913 transitions and 26710 arcs in 763 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2026-05-28 04:36:01] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2026-05-28 04:36:02] [INFO ] Computed 535 invariants in 493 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:[17, 1, 51, 1, 51, 1, 17, 51, 17, 51, 17, 17, 51, 17, 1, 51]
RANDOM walk for 10000 steps (192 resets) in 165 ms. (60 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 150010 steps (750 resets) in 560 ms. (267 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1] Max Struct:[17, 51, 1, 51, 1, 17, 51, 17, 51, 17, 17, 51, 17, 1, 51]
[2026-05-28 04:36:02] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
[2026-05-28 04:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:04] [INFO ] [Real]Absence check using 48 positive place invariants in 102 ms returned sat
[2026-05-28 04:36:04] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 46 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:05] [INFO ] [Real]Absence check using 48 positive place invariants in 115 ms returned sat
[2026-05-28 04:36:05] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 39 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:05] [INFO ] [Real]Absence check using 48 positive place invariants in 64 ms returned sat
[2026-05-28 04:36:06] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 203 ms returned sat
[2026-05-28 04:36:10] [INFO ] [Real]Absence check using state equation in 4068 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:10] [INFO ] [Real]Absence check using 48 positive place invariants in 57 ms returned sat
[2026-05-28 04:36:11] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 331 ms returned sat
[2026-05-28 04:36:14] [INFO ] [Real]Absence check using state equation in 3728 ms returned sat
[2026-05-28 04:36:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:16] [INFO ] [Nat]Absence check using 48 positive place invariants in 57 ms returned sat
[2026-05-28 04:36:16] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 200 ms returned sat
[2026-05-28 04:36:20] [INFO ] [Nat]Absence check using state equation in 4028 ms returned sat
[2026-05-28 04:36:20] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2026-05-28 04:36:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:863)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 48 positive place invariants in 51 ms returned sat
[2026-05-28 04:36:21] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 179 ms returned sat
[2026-05-28 04:36:25] [INFO ] [Real]Absence check using state equation in 4005 ms returned sat
[2026-05-28 04:36:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:863)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2252)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:26] [INFO ] [Real]Absence check using 48 positive place invariants in 51 ms returned sat
[2026-05-28 04:36:26] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 46 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:26] [INFO ] [Real]Absence check using 48 positive place invariants in 54 ms returned sat
[2026-05-28 04:36:27] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 387 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:27] [INFO ] [Real]Absence check using 48 positive place invariants in 52 ms returned sat
[2026-05-28 04:36:27] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 183 ms returned sat
[2026-05-28 04:36:32] [INFO ] [Real]Absence check using state equation in 4152 ms returned sat
[2026-05-28 04:36:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:32] [INFO ] [Nat]Absence check using 48 positive place invariants in 79 ms returned sat
[2026-05-28 04:36:33] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 335 ms returned sat
[2026-05-28 04:36:37] [INFO ] [Nat]Absence check using state equation in 3971 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:37] [INFO ] [Real]Absence check using 48 positive place invariants in 70 ms returned sat
[2026-05-28 04:36:37] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 132 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:38] [INFO ] [Real]Absence check using 48 positive place invariants in 54 ms returned sat
[2026-05-28 04:36:38] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 67 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:39] [INFO ] [Real]Absence check using 48 positive place invariants in 71 ms returned sat
[2026-05-28 04:36:39] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 43 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:39] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2026-05-28 04:36:40] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 198 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:40] [INFO ] [Real]Absence check using 48 positive place invariants in 70 ms returned sat
[2026-05-28 04:36:40] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 65 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:41] [INFO ] [Real]Absence check using 48 positive place invariants in 53 ms returned sat
[2026-05-28 04:36:41] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 183 ms returned sat
[2026-05-28 04:36:45] [INFO ] [Real]Absence check using state equation in 3944 ms returned sat
[2026-05-28 04:36:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:46] [INFO ] [Nat]Absence check using 48 positive place invariants in 55 ms returned sat
[2026-05-28 04:36:46] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 197 ms returned sat
[2026-05-28 04:36:50] [INFO ] [Nat]Absence check using state equation in 3989 ms returned sat
[2026-05-28 04:36:50] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:36:50] [INFO ] [Nat]Added 1906 Read/Feed constraints in 214 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:36:51] [INFO ] [Real]Absence check using 48 positive place invariants in 52 ms returned sat
[2026-05-28 04:36:51] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 168 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1] Max Struct:[1, 1, 1, 51, 1, 1, 1, 17, 1, 1, 1, 1, 1, 1, 1]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 51, 1, 17, 1]
Support contains 5 out of 4914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.28 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1358 transitions
Trivial Post-agglo rules discarded 1358 transitions
Performed 1358 trivial Post agglomeration. Transition count delta: 1358
Iterating post reduction 0 with 1358 rules applied. Total rules applied 1359 place count 4884 transition count 5555
Reduce places removed 1358 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1359 rules applied. Total rules applied 2718 place count 3526 transition count 5554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2719 place count 3525 transition count 5554
Performed 170 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 170 Pre rules applied. Total rules applied 2719 place count 3525 transition count 5384
Deduced a syphon composed of 170 places in 4 ms
Reduce places removed 170 places and 0 transitions.
Iterating global reduction 3 with 340 rules applied. Total rules applied 3059 place count 3355 transition count 5384
Discarding 1188 places :
Symmetric choice reduction at 3 with 1188 rule applications. Total rules 4247 place count 2167 transition count 4196
Iterating global reduction 3 with 1188 rules applied. Total rules applied 5435 place count 2167 transition count 4196
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 5435 place count 2167 transition count 4188
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 5451 place count 2159 transition count 4188
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 5687 place count 1923 transition count 3008
Iterating global reduction 3 with 236 rules applied. Total rules applied 5923 place count 1923 transition count 3008
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 5957 place count 1906 transition count 2991
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 6119 place count 1906 transition count 3773
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 6281 place count 1744 transition count 3773
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 6315 place count 1744 transition count 3773
Applied a total of 6315 rules in 1714 ms. Remains 1744 /4914 variables (removed 3170) and now considering 3773/6913 (removed 3140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1738 ms. Remains : 1744/4914 places, 3773/6913 transitions.
[2026-05-28 04:36:53] [INFO ] Flow matrix only has 3375 transitions (discarded 398 similar events)
// Phase 1: matrix 3375 rows 1744 cols
[2026-05-28 04:36:53] [INFO ] Computed 505 invariants in 47 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 2, 1, 1, 1]
RANDOM walk for 1000000 steps (31866 resets) in 15357 ms. (65 steps per ms)
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (17007 resets) in 10034 ms. (298 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0] Max Struct:[1, 2, 1]
[2026-05-28 04:37:18] [INFO ] Flow matrix only has 3375 transitions (discarded 398 similar events)
[2026-05-28 04:37:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:18] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2026-05-28 04:37:18] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 91 ms returned sat
[2026-05-28 04:37:20] [INFO ] [Real]Absence check using state equation in 1260 ms returned sat
[2026-05-28 04:37:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 33 ms returned sat
[2026-05-28 04:37:20] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 170 ms returned sat
[2026-05-28 04:37:22] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2026-05-28 04:37:22] [INFO ] State equation strengthened by 1906 read => feed constraints.
[2026-05-28 04:37:23] [INFO ] [Nat]Added 1906 Read/Feed constraints in 1780 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:37:25] [INFO ] Deduced a trap composed of 135 places in 1754 ms of which 249 ms to minimize.
[2026-05-28 04:37:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2074 ms
[2026-05-28 04:37:26] [INFO ] Computed and/alt/rep : 1577/3617/1577 causal constraints (skipped 1781 transitions) in 325 ms.
[2026-05-28 04:37:27] [INFO ] Added : 13 causal constraints over 3 iterations in 1292 ms. Result :sat
Minimization took 5603 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:33] [INFO ] [Real]Absence check using 33 positive place invariants in 84 ms returned sat
[2026-05-28 04:37:33] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 52 ms returned unsat
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:33] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2026-05-28 04:37:33] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 149 ms returned sat
[2026-05-28 04:37:34] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2026-05-28 04:37:35] [INFO ] [Real]Added 1906 Read/Feed constraints in 253 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0] Max Struct:[1, 1, 0]
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 1744 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place Node2ThinksNode4ShouldBeNodeMasterToReplaceNode11) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 1744/1744 places, 3771/3771 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1743 transition count 3768
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1741 transition count 3766
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 1740 transition count 3764
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 7 place count 1740 transition count 3762
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 9 place count 1738 transition count 3762
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 11 place count 1736 transition count 3760
Iterating global reduction 4 with 2 rules applied. Total rules applied 13 place count 1736 transition count 3760
Applied a total of 13 rules in 360 ms. Remains 1736 /1744 variables (removed 8) and now considering 3760/3771 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 1736/1744 places, 3760/3771 transitions.
[2026-05-28 04:37:35] [INFO ] Flow matrix only has 3362 transitions (discarded 398 similar events)
// Phase 1: matrix 3362 rows 1736 cols
[2026-05-28 04:37:35] [INFO ] Computed 505 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (31863 resets) in 15946 ms. (62 steps per ms)
BEST_FIRST walk for 1000001 steps (5669 resets) in 3605 ms. (277 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:37:55] [INFO ] Flow matrix only has 3362 transitions (discarded 398 similar events)
[2026-05-28 04:37:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:55] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2026-05-28 04:37:55] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 80 ms returned sat
[2026-05-28 04:37:56] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2026-05-28 04:37:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:37:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 51 ms returned sat
[2026-05-28 04:37:57] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 67 ms returned sat
[2026-05-28 04:37:57] [INFO ] [Nat]Absence check using state equation in 944 ms returned sat
[2026-05-28 04:37:58] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:38:00] [INFO ] [Nat]Added 1902 Read/Feed constraints in 2147 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:01] [INFO ] Deduced a trap composed of 135 places in 1401 ms of which 240 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:03] [INFO ] Deduced a trap composed of 77 places in 1429 ms of which 182 ms to minimize.
[2026-05-28 04:38:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3263 ms
[2026-05-28 04:38:03] [INFO ] Computed and/alt/rep : 1566/3600/1566 causal constraints (skipped 1779 transitions) in 544 ms.
[2026-05-28 04:38:05] [INFO ] Added : 14 causal constraints over 3 iterations in 1808 ms. Result :sat
Minimization took 4503 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 1736 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1736/1736 places, 3760/3760 transitions.
Applied a total of 0 rules in 154 ms. Remains 1736 /1736 variables (removed 0) and now considering 3760/3760 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 1736/1736 places, 3760/3760 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1736/1736 places, 3760/3760 transitions.
Applied a total of 0 rules in 97 ms. Remains 1736 /1736 variables (removed 0) and now considering 3760/3760 (removed 0) transitions.
[2026-05-28 04:38:10] [INFO ] Flow matrix only has 3362 transitions (discarded 398 similar events)
[2026-05-28 04:38:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:38:14] [INFO ] Implicit Places using invariants in 4890 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 142, 144, 157, 163, 165, 166, 167, 168, 169, 170, 172, 176, 182, 190, 200, 212, 225, 237, 238, 239, 240, 241, 242, 252, 260, 266, 270, 272, 274, 287, 293, 295, 296, 297, 298, 299, 300, 302, 304, 308, 314, 322, 332, 343, 353, 354, 355, 356, 357, 358, 366, 369, 373, 375, 377, 379, 392, 398, 400, 401, 402, 403, 404, 405, 407, 409, 411, 415, 421, 429, 438, 446, 447, 448, 449, 450, 451, 457, 461, 463, 465, 467, 469, 482, 488, 490, 491, 492, 493, 494, 495, 497, 499, 501, 503, 507, 513, 520, 526, 527, 528, 529, 530, 531, 535, 537, 539, 541, 543, 545, 558, 564, 566, 567, 568, 569, 570, 571, 573, 575, 577, 579, 581, 585, 590, 594, 595, 596, 597, 598, 599, 601, 603, 605, 607, 609, 611, 624, 630, 632, 633, 634, 635, 636, 637, 639, 641, 643, 645, 647, 649, 652, 654, 655, 656, 657, 658, 659, 661, 663, 665, 667, 669, 671, 684, 690, 692, 693, 694, 695, 696, 697, 699, 701, 703, 705, 707, 709, 711, 713, 714, 715, 716, 717, 718, 720, 722, 724, 726, 728, 730, 743, 745, 748, 750, 751, 752, 753, 754, 755, 757, 759, 761, 763, 765, 767, 769, 771, 772, 773, 774, 775, 776, 778, 780, 782, 784, 786, 788, 801, 807, 809, 810, 811, 812, 813, 814, 816, 818, 820, 822, 824, 826, 828, 830, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 860, 866, 868, 869, 870, 871, 872, 873, 875, 877, 879, 881, 883, 885, 887, 890, 891, 892, 893, 894, 895, 897, 899, 901, 903, 905, 907, 920, 926, 928, 929, 930, 931, 932, 933, 935, 937, 939, 941, 943, 945, 949, 954, 955, 956, 957, 958, 959, 963, 965, 967, 969, 971, 973, 986, 992, 994, 995, 996, 997, 998, 999, 1001, 1003, 1005, 1007, 1009, 1013, 1019, 1026, 1027, 1028, 1029, 1030, 1031, 1037, 1041, 1043, 1045, 1047, 1049, 1062, 1068, 1070, 1071, 1072, 1073, 1074, 1075, 1077, 1079, 1081, 1083, 1087, 1093, 1101, 1110, 1111, 1112, 1113, 1114, 1115, 1123, 1129, 1133, 1135, 1137, 1139, 1152, 1158, 1160, 1161, 1162, 1163, 1164, 1165, 1167, 1169, 1171, 1175, 1181, 1189, 1199, 1210, 1211, 1212, 1213, 1214, 1215, 1225, 1233, 1239, 1243, 1245, 1247, 1260, 1266, 1268, 1269, 1270, 1271, 1272, 1273, 1275, 1277, 1281, 1287, 1295, 1305, 1317, 1330, 1331, 1332, 1333, 1334, 1335, 1347, 1357, 1365, 1371, 1375, 1377, 1390, 1392, 1395, 1397, 1398, 1399, 1400, 1401, 1402, 1404, 1408, 1414, 1422, 1432, 1444, 1458, 1473, 1474, 1475, 1476, 1477, 1478, 1492, 1504, 1514, 1522, 1528, 1532, 1545]
[2026-05-28 04:38:14] [INFO ] Actually due to overlaps returned [157, 287, 392, 482, 558, 624, 684, 743, 801, 860, 920, 986, 1062, 1152, 1260, 1390, 1545, 4, 9, 10, 11, 12, 13, 97, 98, 99, 100, 101, 165, 166, 167, 168, 169, 237, 238, 239, 240, 241, 295, 296, 297, 298, 299, 353, 354, 355, 356, 357, 400, 401, 402, 403, 404, 446, 447, 448, 449, 450, 490, 491, 492, 493, 494, 526, 527, 528, 529, 530, 566, 567, 568, 569, 570, 594, 595, 596, 597, 598, 632, 633, 634, 635, 636, 654, 655, 656, 657, 658, 692, 693, 694, 695, 696, 713, 714, 715, 716, 717, 745, 750, 751, 752, 753, 754, 771, 772, 773, 774, 775, 809, 810, 811, 812, 813, 830, 831, 832, 833, 834, 868, 869, 870, 871, 872, 890, 891, 892, 893, 894, 928, 929, 930, 931, 932, 954, 955, 956, 957, 958, 994, 995, 996, 997, 998, 1026, 1027, 1028, 1029, 1030, 1070, 1071, 1072, 1073, 1074, 1110, 1111, 1112, 1113, 1114, 1160, 1161, 1162, 1163, 1164, 1210, 1211, 1212, 1213, 1214, 1268, 1269, 1270, 1271, 1272, 1330, 1331, 1332, 1333, 1334, 1392, 1397, 1398, 1399, 1400, 1401, 1473, 1474, 1475, 1476, 1477]
Discarding 190 places :
Implicit Place search using SMT only with invariants took 4916 ms to find 190 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1546/1736 places, 3760/3760 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1386 transition count 3600
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1386 transition count 3600
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 1226 transition count 3440
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 1226 transition count 3440
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 1226 transition count 3437
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 1223 transition count 3437
Applied a total of 646 rules in 300 ms. Remains 1223 /1546 variables (removed 323) and now considering 3437/3760 (removed 323) transitions.
[2026-05-28 04:38:15] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
// Phase 1: matrix 3039 rows 1223 cols
[2026-05-28 04:38:15] [INFO ] Computed 315 invariants in 22 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:38:18] [INFO ] Implicit Places using invariants in 2933 ms returned [6, 8, 12, 18, 26, 36, 48, 62, 77, 91, 103, 113, 121, 127, 131, 133, 150, 152, 154, 158, 164, 172, 182, 194, 207, 219, 229, 237, 243, 247, 249, 251, 259, 261, 263, 265, 269, 275, 283, 293, 304, 314, 322, 325, 329, 331, 333, 335, 343, 345, 347, 349, 351, 355, 361, 369, 378, 386, 392, 396, 398, 400, 402, 404, 412, 414, 416, 418, 420, 422, 426, 432, 439, 445, 449, 451, 453, 455, 457, 459, 467, 469, 471, 473, 475, 477, 479, 483, 488, 492, 494, 496, 498, 500, 502, 504, 512, 514, 516, 518, 520, 522, 524, 526, 529, 531, 533, 535, 537, 539, 541, 543, 551, 553, 555, 557, 559, 561, 563, 565, 567, 569, 571, 573, 575, 577, 579, 581, 587, 589, 591, 593, 595, 597, 599, 601, 603, 605, 607, 609, 611, 613, 615, 617, 624, 626, 628, 630, 632, 634, 636, 638, 640, 642, 644, 646, 648, 650, 652, 654, 662, 664, 666, 668, 670, 672, 674, 676, 678, 681, 683, 685, 687, 689, 691, 693, 701, 703, 705, 707, 709, 711, 713, 715, 719, 724, 728, 730, 732, 734, 736, 738, 746, 748, 750, 752, 754, 756, 758, 762, 768, 775, 781, 785, 787, 789, 791, 793, 801, 803, 805, 807, 809, 811, 815, 821, 829, 838, 846, 852, 856, 858, 860, 862, 870, 872, 874, 876, 878, 882, 888, 896, 906, 917, 927, 935, 941, 945, 947, 949, 957, 959, 961, 963, 967, 973, 981, 991, 1003, 1016, 1028, 1038, 1046, 1052, 1056, 1058, 1064, 1066, 1068, 1072, 1078, 1086, 1096, 1108, 1122, 1137, 1151, 1163, 1173, 1181, 1187, 1191]
Discarding 272 places :
Implicit Place search using SMT only with invariants took 2968 ms to find 272 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 951/1736 places, 3437/3760 transitions.
Applied a total of 0 rules in 110 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8432 ms. Remains : 951/1736 places, 3437/3760 transitions.
[2026-05-28 04:38:18] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
// Phase 1: matrix 3039 rows 951 cols
[2026-05-28 04:38:18] [INFO ] Computed 43 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34073 resets) in 14340 ms. (69 steps per ms)
BEST_FIRST walk for 1000000 steps (4038 resets) in 2390 ms. (418 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:38:35] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:38:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:35] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2026-05-28 04:38:35] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2026-05-28 04:38:35] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2026-05-28 04:38:36] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:38:36] [INFO ] [Real]Added 1902 Read/Feed constraints in 398 ms returned sat
[2026-05-28 04:38:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:38:36] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2026-05-28 04:38:36] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2026-05-28 04:38:37] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2026-05-28 04:38:38] [INFO ] [Nat]Added 1902 Read/Feed constraints in 1000 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:39] [INFO ] Deduced a trap composed of 45 places in 697 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:38:40] [INFO ] Deduced a trap composed of 169 places in 633 ms of which 129 ms to minimize.
[2026-05-28 04:38:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1690 ms
[2026-05-28 04:38:40] [INFO ] Computed and/alt/rep : 1324/1904/1324 causal constraints (skipped 1653 transitions) in 185 ms.
[2026-05-28 04:38:41] [INFO ] Added : 13 causal constraints over 3 iterations in 938 ms. Result :sat
Minimization took 4909 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 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 81 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 951/951 places, 3437/3437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 76 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
[2026-05-28 04:38:46] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:38:47] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2026-05-28 04:38:47] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:38:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:38:48] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:39:18] [INFO ] Performed 506/951 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:39:46] [INFO ] Implicit Places using invariants and state equation in 59019 ms returned []
Implicit Place search using SMT with State Equation took 60448 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:39:46] [INFO ] Redundant transitions in 227 ms returned []
Running 3375 sub problems to find dead transitions.
[2026-05-28 04:39:46] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:39:47] [INFO ] Invariant cache hit.
[2026-05-28 04:39:47] [INFO ] State equation strengthened by 1902 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/948 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3375 unsolved
SMT process timed out in 34723ms, After SMT, problems are : Problem set: 0 solved, 3375 unsolved
Search for dead transitions found 0 dead transitions in 34771ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95560 ms. Remains : 951/951 places, 3437/3437 transitions.
RANDOM walk for 40000 steps (1360 resets) in 2080 ms. (19 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (160 resets) in 347 ms. (114 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (162 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
[2026-05-28 04:40:22] [INFO ] Flatten gal took : 368 ms
[2026-05-28 04:40:22] [INFO ] Flatten gal took : 155 ms
[2026-05-28 04:40:22] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14841093495612345595.gal : 90 ms
[2026-05-28 04:40:22] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7164220387603668635.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14841093495612345595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7164220387603668635.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7164220387603668635.prop.
Interrupted probabilistic random walk after 63517 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63517 steps, saw 26535 distinct states, run finished after 3006 ms. (steps per millisecond=21 ) properties seen :0
[2026-05-28 04:40:25] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:40:25] [INFO ] Invariant cache hit.
[2026-05-28 04:40:25] [INFO ] State equation strengthened by 1902 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 37
At refinement iteration 1 (OVERLAPS) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 42
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 55
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/913 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/941 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 128
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD size :55 after 72
At refinement iteration 9 (OVERLAPS) 10/951 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :72 after 139
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :139 after 221
At refinement iteration 11 (OVERLAPS) 3039/3990 variables, 951/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3990 variables, 1902/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :221 after 354
At refinement iteration 14 (OVERLAPS) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3990/3990 variables, and 2896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1948 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 951/951 constraints, ReadFeed: 1902/1902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :354 after 708
[2026-05-28 04:40:28] [INFO ] Deduced a trap composed of 85 places in 776 ms of which 96 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/913 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:29] [INFO ] Deduced a trap composed of 5 places in 589 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:30] [INFO ] Deduced a trap composed of 46 places in 740 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :708 after 1217
[2026-05-28 04:40:30] [INFO ] Deduced a trap composed of 27 places in 629 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:31] [INFO ] Deduced a trap composed of 62 places in 827 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:32] [INFO ] Deduced a trap composed of 75 places in 630 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:33] [INFO ] Deduced a trap composed of 75 places in 753 ms of which 98 ms to minimize.
SMT process timed out in 7521ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 84 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 951/951 places, 3437/3437 transitions.
RANDOM walk for 40000 steps (1361 resets) in 1232 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (161 resets) in 228 ms. (174 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (159 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1217 after 2317
Interrupted probabilistic random walk after 60170 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60170 steps, saw 25147 distinct states, run finished after 3001 ms. (steps per millisecond=20 ) properties seen :0
[2026-05-28 04:40:36] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:40:36] [INFO ] Invariant cache hit.
[2026-05-28 04:40:36] [INFO ] State equation strengthened by 1902 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/913 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/941 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/951 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3039/3990 variables, 951/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3990 variables, 1902/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3990/3990 variables, and 2896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1878 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 951/951 constraints, ReadFeed: 1902/1902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:39] [INFO ] Deduced a trap composed of 85 places in 572 ms of which 82 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/913 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:40] [INFO ] Deduced a trap composed of 5 places in 713 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:41] [INFO ] Deduced a trap composed of 46 places in 889 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:43] [INFO ] Deduced a trap composed of 27 places in 2396 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:44] [INFO ] Deduced a trap composed of 62 places in 664 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:45] [INFO ] Deduced a trap composed of 75 places in 764 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:46] [INFO ] Deduced a trap composed of 75 places in 705 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :2317 after 5443
[2026-05-28 04:40:47] [INFO ] Deduced a trap composed of 90 places in 1038 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:47] [INFO ] Deduced a trap composed of 85 places in 714 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:48] [INFO ] Deduced a trap composed of 92 places in 1140 ms of which 119 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:49] [INFO ] Deduced a trap composed of 94 places in 789 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:50] [INFO ] Deduced a trap composed of 92 places in 697 ms of which 103 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:51] [INFO ] Deduced a trap composed of 111 places in 740 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:52] [INFO ] Deduced a trap composed of 54 places in 976 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:53] [INFO ] Deduced a trap composed of 54 places in 876 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:54] [INFO ] Deduced a trap composed of 46 places in 846 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:54] [INFO ] Deduced a trap composed of 55 places in 728 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:55] [INFO ] Deduced a trap composed of 55 places in 840 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:56] [INFO ] Deduced a trap composed of 55 places in 599 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:56] [INFO ] Deduced a trap composed of 56 places in 644 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:57] [INFO ] Deduced a trap composed of 54 places in 620 ms of which 66 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/913 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:58] [INFO ] Deduced a trap composed of 55 places in 934 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:40:59] [INFO ] Deduced a trap composed of 54 places in 688 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:00] [INFO ] Deduced a trap composed of 54 places in 777 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:00] [INFO ] Deduced a trap composed of 55 places in 866 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:02] [INFO ] Deduced a trap composed of 55 places in 1237 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:02] [INFO ] Deduced a trap composed of 56 places in 545 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:03] [INFO ] Deduced a trap composed of 55 places in 1017 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:04] [INFO ] Deduced a trap composed of 55 places in 947 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:05] [INFO ] Deduced a trap composed of 55 places in 743 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:06] [INFO ] Deduced a trap composed of 55 places in 1026 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:07] [INFO ] Deduced a trap composed of 54 places in 675 ms of which 47 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 32768
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :5443 after 10682
[2026-05-28 04:41:08] [INFO ] Deduced a trap composed of 54 places in 726 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:08] [INFO ] Deduced a trap composed of 55 places in 807 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:09] [INFO ] Deduced a trap composed of 94 places in 665 ms of which 104 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:10] [INFO ] Deduced a trap composed of 46 places in 675 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:11] [INFO ] Deduced a trap composed of 50 places in 911 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:12] [INFO ] Deduced a trap composed of 51 places in 740 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:12] [INFO ] Deduced a trap composed of 27 places in 717 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-28 04:41:13] [INFO ] Flatten gal took : 119 ms
[2026-05-28 04:41:13] [INFO ] Applying decomposition
[2026-05-28 04:41:13] [INFO ] Flatten gal took : 120 ms
[2026-05-28 04:41:13] [INFO ] Deduced a trap composed of 54 places in 646 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10268769394531146561.txt' '-o' '/tmp/graph10268769394531146561.bin' '-w' '/tmp/graph10268769394531146561.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10268769394531146561.bin' '-l' '-1' '-v' '-w' '/tmp/graph10268769394531146561.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:41:13] [INFO ] Decomposing Gal with order
[2026-05-28 04:41:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:41:14] [INFO ] Deduced a trap composed of 54 places in 602 ms of which 91 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/913 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:14] [INFO ] Deduced a trap composed of 46 places in 602 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:15] [INFO ] Removed a total of 5805 redundant transitions.
[2026-05-28 04:41:15] [INFO ] Flatten gal took : 1267 ms
[2026-05-28 04:41:15] [INFO ] Deduced a trap composed of 58 places in 509 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2673 labels/synchronizations in 227 ms.
[2026-05-28 04:41:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16986644528212368484.gal : 50 ms
[2026-05-28 04:41:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality556378133893397714.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16986644528212368484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality556378133893397714.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
[2026-05-28 04:41:15] [INFO ] Deduced a trap composed of 55 places in 502 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality556378133893397714.prop.
[2026-05-28 04:41:16] [INFO ] Deduced a trap composed of 55 places in 544 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:17] [INFO ] Deduced a trap composed of 59 places in 1206 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:18] [INFO ] Deduced a trap composed of 52 places in 1153 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:19] [INFO ] Deduced a trap composed of 59 places in 899 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:20] [INFO ] Deduced a trap composed of 51 places in 929 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:21] [INFO ] Deduced a trap composed of 52 places in 896 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:22] [INFO ] Deduced a trap composed of 52 places in 673 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:23] [INFO ] Deduced a trap composed of 52 places in 898 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:41:24] [INFO ] Deduced a trap composed of 53 places in 1008 ms of which 69 ms to minimize.
SMT process timed out in 47567ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 142 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 951/951 places, 3437/3437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 85 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
[2026-05-28 04:41:24] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:41:26] [INFO ] Implicit Places using invariants in 1947 ms returned []
[2026-05-28 04:41:26] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:41:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:41:27] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:41:57] [INFO ] Performed 461/951 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2026-05-28 04:42:28] [INFO ] Performed 932/951 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2026-05-28 04:42:33] [INFO ] Implicit Places using invariants and state equation in 66789 ms returned []
Implicit Place search using SMT with State Equation took 68775 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:42:33] [INFO ] Redundant transitions in 218 ms returned []
Running 3375 sub problems to find dead transitions.
[2026-05-28 04:42:33] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:42:33] [INFO ] Invariant cache hit.
[2026-05-28 04:42:33] [INFO ] State equation strengthened by 1902 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/948 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3375 unsolved
SMT process timed out in 34379ms, After SMT, problems are : Problem set: 0 solved, 3375 unsolved
Search for dead transitions found 0 dead transitions in 34392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103491 ms. Remains : 951/951 places, 3437/3437 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Starting property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:43:07] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:43:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (341 resets) in 163 ms. (60 steps per ms)
BEST_FIRST walk for 10001 steps (39 resets) in 25 ms. (384 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:43:08] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:43:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:43:08] [INFO ] [Real]Absence check using 31 positive place invariants in 20 ms returned sat
[2026-05-28 04:43:08] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2026-05-28 04:43:09] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2026-05-28 04:43:09] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:43:09] [INFO ] [Real]Added 1902 Read/Feed constraints in 388 ms returned sat
[2026-05-28 04:43:09] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:43:09] [INFO ] [Nat]Absence check using 31 positive place invariants in 26 ms returned sat
[2026-05-28 04:43:09] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 6 ms returned sat
[2026-05-28 04:43:10] [INFO ] [Nat]Absence check using state equation in 634 ms returned sat
[2026-05-28 04:43:10] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-28 04:43:11] [INFO ] [Nat]Added 1902 Read/Feed constraints in 1101 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:12] [INFO ] Deduced a trap composed of 60 places in 615 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:12] [INFO ] Deduced a trap composed of 169 places in 599 ms of which 125 ms to minimize.
[2026-05-28 04:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1513 ms
[2026-05-28 04:43:13] [INFO ] Computed and/alt/rep : 1324/1904/1324 causal constraints (skipped 1653 transitions) in 169 ms.
[2026-05-28 04:43:14] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:946)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
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 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 77 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 951/951 places, 3437/3437 transitions.
[2026-05-28 04:43:14] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:43:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (34072 resets) in 14239 ms. (70 steps per ms)
BEST_FIRST walk for 1000001 steps (4036 resets) in 2260 ms. (442 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-28 04:43:31] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:43:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:43:31] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2026-05-28 04:43:31] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2026-05-28 04:43:32] [INFO ] [Real]Absence check using state equation in 721 ms returned sat
[2026-05-28 04:43:32] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:43:32] [INFO ] [Real]Added 1902 Read/Feed constraints in 284 ms returned sat
[2026-05-28 04:43:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-28 04:43:32] [INFO ] [Nat]Absence check using 31 positive place invariants in 18 ms returned sat
[2026-05-28 04:43:32] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2026-05-28 04:43:33] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2026-05-28 04:43:34] [INFO ] [Nat]Added 1902 Read/Feed constraints in 1009 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:35] [INFO ] Deduced a trap composed of 45 places in 683 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:43:36] [INFO ] Deduced a trap composed of 169 places in 824 ms of which 127 ms to minimize.
[2026-05-28 04:43:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1853 ms
[2026-05-28 04:43:36] [INFO ] Computed and/alt/rep : 1324/1904/1324 causal constraints (skipped 1653 transitions) in 179 ms.
[2026-05-28 04:43:37] [INFO ] Added : 13 causal constraints over 3 iterations in 906 ms. Result :sat
Minimization took 4920 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 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 142 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 951/951 places, 3437/3437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 104 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
[2026-05-28 04:43:42] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:43:44] [INFO ] Implicit Places using invariants in 1623 ms returned []
[2026-05-28 04:43:44] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:43:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:43:45] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:44:15] [INFO ] Performed 503/951 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-05-28 04:44:43] [INFO ] Implicit Places using invariants and state equation in 59425 ms returned []
Implicit Place search using SMT with State Equation took 61068 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:44:43] [INFO ] Redundant transitions in 138 ms returned []
Running 3375 sub problems to find dead transitions.
[2026-05-28 04:44:43] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:44:43] [INFO ] Invariant cache hit.
[2026-05-28 04:44:43] [INFO ] State equation strengthened by 1902 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 0.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 0.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/948 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3375 unsolved
SMT process timed out in 34055ms, After SMT, problems are : Problem set: 0 solved, 3375 unsolved
Search for dead transitions found 0 dead transitions in 34064ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95397 ms. Remains : 951/951 places, 3437/3437 transitions.
[2026-05-28 04:45:17] [INFO ] Flatten gal took : 248 ms
RANDOM walk for 40000 steps (1361 resets) in 1214 ms. (32 steps per ms) remains 2/2 properties
[2026-05-28 04:45:18] [INFO ] Flatten gal took : 123 ms
[2026-05-28 04:45:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8668196146709540380.gal : 25 ms
[2026-05-28 04:45:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2484202216171622538.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8668196146709540380.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2484202216171622538.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 40003 steps (160 resets) in 289 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (157 resets) in 339 ms. (117 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2484202216171622538.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 27
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :27 after 29
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :29 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 42
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :42 after 55
Interrupted probabilistic random walk after 63573 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 2
Probabilistic random walk after 63573 steps, saw 26559 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :0
[2026-05-28 04:45:21] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:45:21] [INFO ] Invariant cache hit.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :55 after 72
[2026-05-28 04:45:21] [INFO ] State equation strengthened by 1902 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :72 after 139
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) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :139 after 221
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/913 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/941 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/951 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :221 after 354
At refinement iteration 11 (OVERLAPS) 3039/3990 variables, 951/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3990 variables, 1902/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3990/3990 variables, and 2896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2070 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 951/951 constraints, ReadFeed: 1902/1902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :354 after 708
At refinement iteration 1 (OVERLAPS) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:24] [INFO ] Deduced a trap composed of 85 places in 776 ms of which 86 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/913 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:25] [INFO ] Deduced a trap composed of 5 places in 505 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :708 after 1217
[2026-05-28 04:45:25] [INFO ] Deduced a trap composed of 46 places in 633 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:26] [INFO ] Deduced a trap composed of 27 places in 1070 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:27] [INFO ] Deduced a trap composed of 62 places in 774 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:28] [INFO ] Deduced a trap composed of 75 places in 730 ms of which 87 ms to minimize.
SMT process timed out in 7183ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 94 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 951/951 places, 3437/3437 transitions.
RANDOM walk for 40000 steps (1359 resets) in 1670 ms. (23 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (158 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (157 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1217 after 2317
Interrupted probabilistic random walk after 67621 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 2
Probabilistic random walk after 67621 steps, saw 28230 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2026-05-28 04:45:32] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:45:32] [INFO ] Invariant cache hit.
[2026-05-28 04:45:32] [INFO ] State equation strengthened by 1902 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 28/913 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/913 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/941 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/941 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 10/951 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/951 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3039/3990 variables, 951/994 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3990 variables, 1902/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3990 variables, 0/2896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3990/3990 variables, and 2896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1688 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 951/951 constraints, ReadFeed: 1902/1902 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
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) 866/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/885 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:34] [INFO ] Deduced a trap composed of 85 places in 587 ms of which 79 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/885 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/913 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:35] [INFO ] Deduced a trap composed of 5 places in 455 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:35] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:36] [INFO ] Deduced a trap composed of 27 places in 465 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:36] [INFO ] Deduced a trap composed of 62 places in 496 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:37] [INFO ] Deduced a trap composed of 75 places in 594 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:38] [INFO ] Deduced a trap composed of 75 places in 527 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:38] [INFO ] Deduced a trap composed of 90 places in 526 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:39] [INFO ] Deduced a trap composed of 85 places in 521 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:39] [INFO ] Deduced a trap composed of 92 places in 547 ms of which 100 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:40] [INFO ] Deduced a trap composed of 94 places in 513 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:40] [INFO ] Deduced a trap composed of 92 places in 534 ms of which 99 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:41] [INFO ] Deduced a trap composed of 111 places in 545 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:41] [INFO ] Deduced a trap composed of 54 places in 586 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:42] [INFO ] Deduced a trap composed of 54 places in 544 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:43] [INFO ] Deduced a trap composed of 46 places in 561 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:43] [INFO ] Deduced a trap composed of 55 places in 547 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:44] [INFO ] Deduced a trap composed of 55 places in 573 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:44] [INFO ] Deduced a trap composed of 55 places in 555 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:45] [INFO ] Deduced a trap composed of 56 places in 497 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:45] [INFO ] Deduced a trap composed of 54 places in 571 ms of which 64 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/913 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:46] [INFO ] Deduced a trap composed of 55 places in 560 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:46] [INFO ] Deduced a trap composed of 54 places in 494 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:47] [INFO ] Deduced a trap composed of 54 places in 597 ms of which 78 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 16384
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :2317 after 5443
[2026-05-28 04:45:48] [INFO ] Deduced a trap composed of 55 places in 524 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:48] [INFO ] Deduced a trap composed of 55 places in 556 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:49] [INFO ] Deduced a trap composed of 56 places in 559 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:49] [INFO ] Deduced a trap composed of 55 places in 519 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:50] [INFO ] Deduced a trap composed of 55 places in 530 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:50] [INFO ] Deduced a trap composed of 55 places in 569 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:51] [INFO ] Deduced a trap composed of 55 places in 565 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:52] [INFO ] Deduced a trap composed of 54 places in 526 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:52] [INFO ] Deduced a trap composed of 54 places in 530 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:53] [INFO ] Deduced a trap composed of 55 places in 553 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:53] [INFO ] Deduced a trap composed of 94 places in 479 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:54] [INFO ] Deduced a trap composed of 46 places in 750 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:55] [INFO ] Deduced a trap composed of 50 places in 534 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:55] [INFO ] Deduced a trap composed of 51 places in 601 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:56] [INFO ] Deduced a trap composed of 27 places in 510 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:56] [INFO ] Deduced a trap composed of 54 places in 606 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:57] [INFO ] Deduced a trap composed of 54 places in 588 ms of which 63 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/913 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:58] [INFO ] Deduced a trap composed of 46 places in 590 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:58] [INFO ] Deduced a trap composed of 58 places in 594 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:59] [INFO ] Deduced a trap composed of 55 places in 667 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:45:59] [INFO ] Deduced a trap composed of 55 places in 596 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:00] [INFO ] Deduced a trap composed of 59 places in 562 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:01] [INFO ] Deduced a trap composed of 52 places in 571 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:01] [INFO ] Deduced a trap composed of 59 places in 578 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:02] [INFO ] Deduced a trap composed of 51 places in 549 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:02] [INFO ] Deduced a trap composed of 52 places in 559 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:03] [INFO ] Deduced a trap composed of 52 places in 587 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:04] [INFO ] Deduced a trap composed of 52 places in 569 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:04] [INFO ] Deduced a trap composed of 53 places in 552 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:05] [INFO ] Deduced a trap composed of 51 places in 640 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:05] [INFO ] Deduced a trap composed of 52 places in 539 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:06] [INFO ] Deduced a trap composed of 52 places in 558 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:07] [INFO ] Deduced a trap composed of 53 places in 548 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:07] [INFO ] Deduced a trap composed of 53 places in 558 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Detected timeout of ITS tools.
[2026-05-28 04:46:08] [INFO ] Deduced a trap composed of 51 places in 581 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:08] [INFO ] Flatten gal took : 157 ms
[2026-05-28 04:46:08] [INFO ] Applying decomposition
[2026-05-28 04:46:08] [INFO ] Flatten gal took : 118 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3196986901638751385.txt' '-o' '/tmp/graph3196986901638751385.bin' '-w' '/tmp/graph3196986901638751385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3196986901638751385.bin' '-l' '-1' '-v' '-w' '/tmp/graph3196986901638751385.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:46:08] [INFO ] Decomposing Gal with order
[2026-05-28 04:46:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:46:08] [INFO ] Deduced a trap composed of 52 places in 610 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:09] [INFO ] Removed a total of 5812 redundant transitions.
[2026-05-28 04:46:09] [INFO ] Flatten gal took : 454 ms
[2026-05-28 04:46:09] [INFO ] Deduced a trap composed of 52 places in 529 ms of which 70 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/913 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 3020 labels/synchronizations in 145 ms.
[2026-05-28 04:46:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12789537437065327183.gal : 30 ms
[2026-05-28 04:46:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2130620827831327673.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12789537437065327183.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2130620827831327673.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
[2026-05-28 04:46:10] [INFO ] Deduced a trap composed of 52 places in 541 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Loading property file /tmp/ReachabilityCardinality2130620827831327673.prop.
[2026-05-28 04:46:10] [INFO ] Deduced a trap composed of 53 places in 631 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:11] [INFO ] Deduced a trap composed of 52 places in 596 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:11] [INFO ] Deduced a trap composed of 53 places in 579 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:12] [INFO ] Deduced a trap composed of 53 places in 523 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:13] [INFO ] Deduced a trap composed of 54 places in 561 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:13] [INFO ] Deduced a trap composed of 54 places in 589 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:14] [INFO ] Deduced a trap composed of 54 places in 522 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:14] [INFO ] Deduced a trap composed of 53 places in 599 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:15] [INFO ] Deduced a trap composed of 54 places in 537 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:15] [INFO ] Deduced a trap composed of 52 places in 618 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:16] [INFO ] Deduced a trap composed of 53 places in 585 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:17] [INFO ] Deduced a trap composed of 53 places in 516 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:17] [INFO ] Deduced a trap composed of 54 places in 577 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:18] [INFO ] Deduced a trap composed of 54 places in 562 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:18] [INFO ] Deduced a trap composed of 55 places in 551 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:46:19] [INFO ] Deduced a trap composed of 56 places in 541 ms of which 70 ms to minimize.
SMT process timed out in 47167ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 100 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 951/951 places, 3437/3437 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 951/951 places, 3437/3437 transitions.
Applied a total of 0 rules in 77 ms. Remains 951 /951 variables (removed 0) and now considering 3437/3437 (removed 0) transitions.
[2026-05-28 04:46:19] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:46:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:46:20] [INFO ] Implicit Places using invariants in 1265 ms returned []
[2026-05-28 04:46:20] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:46:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-28 04:46:21] [INFO ] State equation strengthened by 1902 read => feed constraints.
[2026-05-28 04:46:52] [INFO ] Performed 478/951 implicitness test of which 0 returned IMPLICIT in 30 seconds.
Detected timeout of ITS tools.
[2026-05-28 04:47:22] [INFO ] Performed 932/951 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-05-28 04:47:27] [INFO ] Implicit Places using invariants and state equation in 66842 ms returned []
Implicit Place search using SMT with State Equation took 68117 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-28 04:47:27] [INFO ] Redundant transitions in 189 ms returned []
Running 3375 sub problems to find dead transitions.
[2026-05-28 04:47:27] [INFO ] Flow matrix only has 3039 transitions (discarded 398 similar events)
[2026-05-28 04:47:27] [INFO ] Invariant cache hit.
[2026-05-28 04:47:27] [INFO ] State equation strengthened by 1902 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/948 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 3375 unsolved
SMT process timed out in 34024ms, After SMT, problems are : Problem set: 0 solved, 3375 unsolved
Search for dead transitions found 0 dead transitions in 34031ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102433 ms. Remains : 951/951 places, 3437/3437 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for MultiCrashLeafsetExtension-PT-S16C05-UpperBounds-03 in 294039 ms.
[2026-05-28 04:48:02] [INFO ] Flatten gal took : 91 ms
[2026-05-28 04:48:02] [INFO ] Applying decomposition
[2026-05-28 04:48:02] [INFO ] Flatten gal took : 93 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13319571069084201510.txt' '-o' '/tmp/graph13319571069084201510.bin' '-w' '/tmp/graph13319571069084201510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13319571069084201510.bin' '-l' '-1' '-v' '-w' '/tmp/graph13319571069084201510.weights' '-q' '0' '-e' '0.001'
[2026-05-28 04:48:02] [INFO ] Decomposing Gal with order
[2026-05-28 04:48:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-28 04:48:02] [INFO ] Removed a total of 5784 redundant transitions.
[2026-05-28 04:48:02] [INFO ] Flatten gal took : 377 ms
[2026-05-28 04:48:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2728 labels/synchronizations in 113 ms.
[2026-05-28 04:48:03] [INFO ] Time to serialize gal into /tmp/UpperBounds16415689408504144556.gal : 22 ms
[2026-05-28 04:48:03] [INFO ] Time to serialize properties into /tmp/UpperBounds6333423886523354939.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16415689408504144556.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6333423886523354939.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds6333423886523354939.prop.
ITS-tools command line returned an error code 137
[2026-05-28 04:58:14] [INFO ] Flatten gal took : 895 ms
[2026-05-28 04:58:15] [INFO ] Time to serialize gal into /tmp/UpperBounds15093413979325313915.gal : 158 ms
[2026-05-28 04:58:15] [INFO ] Time to serialize properties into /tmp/UpperBounds8287174526835866313.prop : 3 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds15093413979325313915.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8287174526835866313.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...305
Loading property file /tmp/UpperBounds8287174526835866313.prop.
ITS-tools command line returned an error code 137
[2026-05-28 05:14:28] [INFO ] Flatten gal took : 716 ms
[2026-05-28 05:14:34] [INFO ] Input system was already deterministic with 3437 transitions.
[2026-05-28 05:14:34] [INFO ] Transformed 951 places.
[2026-05-28 05:14:34] [INFO ] Transformed 3437 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-28 05:14:35] [INFO ] Time to serialize gal into /tmp/UpperBounds17325875839016559068.gal : 14 ms
[2026-05-28 05:14:35] [INFO ] Time to serialize properties into /tmp/UpperBounds5795360625288411451.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds17325875839016559068.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5795360625288411451.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5795360625288411451.prop.
ITS-tools command line returned an error code 137
Total runtime 3226659 ms.

BK_STOP 1779946189315

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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 gold2025"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, 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 r191-oct2-177969025600052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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