Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r047-tall-177946846500075.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is BusinessProcesses-PT-19, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tall-177946846500075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 189K 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 BusinessProcesses-PT-19-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779485151166

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-22 21:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 21:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 21:25:52] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2026-05-22 21:25:52] [INFO ] Transformed 772 places.
[2026-05-22 21:25:52] [INFO ] Transformed 685 transitions.
[2026-05-22 21:25:52] [INFO ] Found NUPN structural information;
[2026-05-22 21:25:52] [INFO ] Parsed PT model containing 772 places and 685 transitions and 1981 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 15 places in 14 ms
Reduce places removed 15 places and 15 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 670 rows 757 cols
[2026-05-22 21:25:52] [INFO ] Computed 125 invariants in 36 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (54 resets) in 68 ms. (144 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70006 steps (67 resets) in 113 ms. (614 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-22 21:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:25:53] [INFO ] [Real]Absence check using 78 positive place invariants in 48 ms returned sat
[2026-05-22 21:25:53] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 29 ms returned sat
[2026-05-22 21:25:53] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:54] [INFO ] Deduced a trap composed of 8 places in 252 ms of which 22 ms to minimize.
[2026-05-22 21:25:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:25:54] [INFO ] [Nat]Absence check using 78 positive place invariants in 45 ms returned sat
[2026-05-22 21:25:54] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2026-05-22 21:25:54] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:54] [INFO ] Deduced a trap composed of 8 places in 164 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:54] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:55] [INFO ] Deduced a trap composed of 14 places in 167 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:55] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:55] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:55] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:55] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:56] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:56] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:56] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:56] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:56] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:56] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:57] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:57] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:57] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:57] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:57] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:58] [INFO ] Deduced a trap composed of 31 places in 151 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:58] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:58] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:58] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:58] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:58] [INFO ] Deduced a trap composed of 34 places in 140 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:59] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 26 ms to minimize.
[2026-05-22 21:25:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
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-22 21:25:59] [INFO ] [Real]Absence check using 78 positive place invariants in 41 ms returned sat
[2026-05-22 21:25:59] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 33 ms returned sat
[2026-05-22 21:25:59] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:25:59] [INFO ] Deduced a trap composed of 8 places in 213 ms of which 14 ms to minimize.
[2026-05-22 21:25:59] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:25:59] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2026-05-22 21:25:59] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2026-05-22 21:26:00] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:00] [INFO ] Deduced a trap composed of 8 places in 220 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:00] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:00] [INFO ] Deduced a trap composed of 11 places in 199 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:01] [INFO ] Deduced a trap composed of 14 places in 202 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:01] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:01] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:01] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:02] [INFO ] Deduced a trap composed of 19 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:02] [INFO ] Deduced a trap composed of 22 places in 200 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:02] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:02] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:02] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:03] [INFO ] Deduced a trap composed of 31 places in 122 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:03] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:03] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:03] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:03] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:03] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 4 ms to minimize.
[2026-05-22 21:26:03] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3471 ms
[2026-05-22 21:26:03] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 41 ms.
[2026-05-22 21:26:04] [INFO ] Added : 135 causal constraints over 27 iterations in 1092 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:05] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:05] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2026-05-22 21:26:05] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:05] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 22 ms to minimize.
[2026-05-22 21:26:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:05] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2026-05-22 21:26:05] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2026-05-22 21:26:05] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:06] [INFO ] Deduced a trap composed of 8 places in 212 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:06] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:06] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:06] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:07] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:07] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:07] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:07] [INFO ] Deduced a trap composed of 37 places in 141 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:07] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 6 ms to minimize.
[2026-05-22 21:26:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1781 ms
[2026-05-22 21:26:07] [INFO ] Computed and/alt/rep : 629/987/629 causal constraints (skipped 40 transitions) in 35 ms.
[2026-05-22 21:26:10] [INFO ] Added : 300 causal constraints over 60 iterations in 2833 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:10] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:10] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 24 ms returned sat
[2026-05-22 21:26:10] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:11] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 15 ms to minimize.
[2026-05-22 21:26:11] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:11] [INFO ] [Nat]Absence check using 78 positive place invariants in 45 ms returned sat
[2026-05-22 21:26:11] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 29 ms returned sat
[2026-05-22 21:26:11] [INFO ] [Nat]Absence check using state equation in 229 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:11] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:12] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:12] [INFO ] Deduced a trap composed of 13 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:12] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:12] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:13] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:13] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:13] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:13] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:14] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:14] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:14] [INFO ] Deduced a trap composed of 16 places in 207 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:14] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:15] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:15] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:15] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:15] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:16] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:16] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 32 ms to minimize.
[2026-05-22 21:26:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
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-22 21:26:16] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:16] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 22 ms returned sat
[2026-05-22 21:26:16] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:17] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 14 ms to minimize.
[2026-05-22 21:26:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:17] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:17] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 23 ms returned sat
[2026-05-22 21:26:17] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:17] [INFO ] Deduced a trap composed of 8 places in 206 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:17] [INFO ] Deduced a trap composed of 8 places in 207 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:18] [INFO ] Deduced a trap composed of 11 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:18] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:18] [INFO ] Deduced a trap composed of 15 places in 196 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:18] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:19] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:19] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:19] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:19] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:20] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:20] [INFO ] Deduced a trap composed of 22 places in 141 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:20] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:20] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:20] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:20] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:21] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:21] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:21] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:21] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:21] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:21] [INFO ] Deduced a trap composed of 33 places in 146 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:22] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 24 ms to minimize.
[2026-05-22 21:26:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
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-22 21:26:22] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:22] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 29 ms returned sat
[2026-05-22 21:26:22] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:22] [INFO ] Deduced a trap composed of 8 places in 215 ms of which 14 ms to minimize.
[2026-05-22 21:26:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:23] [INFO ] [Nat]Absence check using 78 positive place invariants in 37 ms returned sat
[2026-05-22 21:26:23] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 17 ms returned sat
[2026-05-22 21:26:23] [INFO ] [Nat]Absence check using state equation in 245 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:23] [INFO ] Deduced a trap composed of 8 places in 224 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:23] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:24] [INFO ] Deduced a trap composed of 11 places in 201 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:24] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:24] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:24] [INFO ] Deduced a trap composed of 14 places in 182 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:24] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:25] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:25] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:25] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:25] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:26] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:26] [INFO ] Deduced a trap composed of 19 places in 194 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:26] [INFO ] Deduced a trap composed of 16 places in 194 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:26] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:26] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:27] [INFO ] Deduced a trap composed of 31 places in 198 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:27] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:27] [INFO ] Deduced a trap composed of 33 places in 194 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:27] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 35 ms to minimize.
[2026-05-22 21:26:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
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-22 21:26:28] [INFO ] [Real]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:28] [INFO ] [Real]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2026-05-22 21:26:28] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:28] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 15 ms to minimize.
[2026-05-22 21:26:28] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-22 21:26:28] [INFO ] [Nat]Absence check using 78 positive place invariants in 36 ms returned sat
[2026-05-22 21:26:28] [INFO ] [Nat]Absence check using 78 positive and 47 generalized place invariants in 25 ms returned sat
[2026-05-22 21:26:29] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:29] [INFO ] Deduced a trap composed of 8 places in 218 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:29] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:30] [INFO ] Deduced a trap composed of 14 places in 226 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:30] [INFO ] Deduced a trap composed of 15 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:30] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:30] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:30] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:31] [INFO ] Deduced a trap composed of 18 places in 211 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:31] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:31] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:31] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:32] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:32] [INFO ] Deduced a trap composed of 23 places in 216 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:32] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:32] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:33] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:33] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:33] [INFO ] Deduced a trap composed of 26 places in 190 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-22 21:26:33] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 22 ms to minimize.
[2026-05-22 21:26:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 670/670 transitions.
Graph (trivial) has 428 edges and 757 vertex of which 7 / 757 are part of one of the 1 SCC in 4 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1512 edges and 751 vertex of which 742 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 742 transition count 493
Reduce places removed 168 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 170 rules applied. Total rules applied 340 place count 574 transition count 491
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 572 transition count 491
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 342 place count 572 transition count 379
Deduced a syphon composed of 112 places in 3 ms
Ensure Unique test removed 22 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 588 place count 438 transition count 379
Discarding 98 places :
Symmetric choice reduction at 3 with 98 rule applications. Total rules 686 place count 340 transition count 281
Iterating global reduction 3 with 98 rules applied. Total rules applied 784 place count 340 transition count 281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 784 place count 340 transition count 272
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 804 place count 329 transition count 272
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 238 rules applied. Total rules applied 1042 place count 209 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1044 place count 208 transition count 157
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1046 place count 208 transition count 155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1048 place count 206 transition count 155
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1049 place count 206 transition count 155
Applied a total of 1049 rules in 166 ms. Remains 206 /757 variables (removed 551) and now considering 155/670 (removed 515) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 206/757 places, 155/670 transitions.
// Phase 1: matrix 155 rows 206 cols
[2026-05-22 21:26:34] [INFO ] Computed 91 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (46018 resets) in 3506 ms. (285 steps per ms)
FORMULA BusinessProcesses-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (24939 resets) in 2359 ms. (423 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-22 21:26:40] [INFO ] Flatten gal took : 65 ms
[2026-05-22 21:26:40] [INFO ] Flatten gal took : 22 ms
[2026-05-22 21:26:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12537332788845274161.gal : 12 ms
[2026-05-22 21:26:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1798934316122513771.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/ReachabilityCardinality12537332788845274161.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1798934316122513771.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :
ITS tools runner thread asked to quit. Dying gracefully.

/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
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 47942 ms.

BK_STOP 1779485200473

--------------------
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="BusinessProcesses-PT-19"
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 BusinessProcesses-PT-19, 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 r047-tall-177946846500075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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