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.r143-smll-177955812400035.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 FireWire-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-smll-177955812400035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 7 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 05:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 7 05:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Mar 7 05:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 7 05:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 7 05:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:09 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 153K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FireWire-PT-17-UpperBounds-00
FORMULA_NAME FireWire-PT-17-UpperBounds-01
FORMULA_NAME FireWire-PT-17-UpperBounds-02
FORMULA_NAME FireWire-PT-17-UpperBounds-03
FORMULA_NAME FireWire-PT-17-UpperBounds-04
FORMULA_NAME FireWire-PT-17-UpperBounds-05
FORMULA_NAME FireWire-PT-17-UpperBounds-06
FORMULA_NAME FireWire-PT-17-UpperBounds-07
FORMULA_NAME FireWire-PT-17-UpperBounds-08
FORMULA_NAME FireWire-PT-17-UpperBounds-09
FORMULA_NAME FireWire-PT-17-UpperBounds-10
FORMULA_NAME FireWire-PT-17-UpperBounds-11
FORMULA_NAME FireWire-PT-17-UpperBounds-12
FORMULA_NAME FireWire-PT-17-UpperBounds-13
FORMULA_NAME FireWire-PT-17-UpperBounds-14
FORMULA_NAME FireWire-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779626147625

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:35:50] [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-24 12:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:35:50] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2026-05-24 12:35:50] [INFO ] Transformed 428 places.
[2026-05-24 12:35:50] [INFO ] Transformed 656 transitions.
[2026-05-24 12:35:50] [INFO ] Found NUPN structural information;
[2026-05-24 12:35:50] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 346 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 656 rows 428 cols
[2026-05-24 12:35:50] [INFO ] Computed 9 invariants in 55 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 (4 resets) in 79 ms. (125 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80000 steps (24 resets) in 277 ms. (287 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
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-24 12:35:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:35:51] [INFO ] [Real]Absence check using 9 positive place invariants in 31 ms returned sat
[2026-05-24 12:35:52] [INFO ] [Real]Absence check using state equation in 529 ms returned sat
[2026-05-24 12:35:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:35:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 21 ms returned sat
[2026-05-24 12:35:52] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2026-05-24 12:35:53] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 75 ms.
Maximisation of solution failed !
Minimization took 14 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:35:57] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-24 12:35:58] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:58] [INFO ] Deduced a trap composed of 17 places in 317 ms of which 37 ms to minimize.
[2026-05-24 12:35:58] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:35:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-05-24 12:35:59] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:35:59] [INFO ] Deduced a trap composed of 17 places in 532 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:00] [INFO ] Deduced a trap composed of 79 places in 567 ms of which 75 ms to minimize.
[2026-05-24 12:36:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1247 ms
[2026-05-24 12:36:00] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 89 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:03] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2026-05-24 12:36:04] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:04] [INFO ] Deduced a trap composed of 17 places in 217 ms of which 18 ms to minimize.
[2026-05-24 12:36:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2026-05-24 12:36:05] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:05] [INFO ] Deduced a trap composed of 102 places in 593 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:06] [INFO ] Deduced a trap composed of 195 places in 639 ms of which 136 ms to minimize.
[2026-05-24 12:36:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1357 ms
[2026-05-24 12:36:06] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 80 ms.
[2026-05-24 12:36:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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: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-24 12:36:09] [INFO ] [Real]Absence check using 9 positive place invariants in 35 ms returned sat
[2026-05-24 12:36:10] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:11] [INFO ] Deduced a trap composed of 79 places in 584 ms of which 108 ms to minimize.
[2026-05-24 12:36: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-24 12:36:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 38 ms returned sat
[2026-05-24 12:36:11] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:12] [INFO ] Deduced a trap composed of 17 places in 499 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:12] [INFO ] Deduced a trap composed of 17 places in 523 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:13] [INFO ] Deduced a trap composed of 79 places in 581 ms of which 107 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:14] [INFO ] Deduced a trap composed of 102 places in 543 ms of which 118 ms to minimize.
[2026-05-24 12:36:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2348 ms
[2026-05-24 12:36:14] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 68 ms.
[2026-05-24 12:36: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.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: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-24 12:36:16] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2026-05-24 12:36:16] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:16] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 7 ms to minimize.
[2026-05-24 12:36:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2026-05-24 12:36:17] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:18] [INFO ] Deduced a trap composed of 17 places in 486 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:18] [INFO ] Deduced a trap composed of 79 places in 560 ms of which 97 ms to minimize.
[2026-05-24 12:36:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1163 ms
[2026-05-24 12:36:18] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 83 ms.
[2026-05-24 12:36:21] [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.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: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-24 12:36:22] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-24 12:36:22] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:22] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 10 ms to minimize.
[2026-05-24 12:36: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-24 12:36:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 24 ms returned sat
[2026-05-24 12:36:23] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2026-05-24 12:36:23] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 75 ms.
[2026-05-24 12:36:27] [INFO ] Added : 285 causal constraints over 57 iterations in 4332 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:28] [INFO ] [Real]Absence check using 9 positive place invariants in 35 ms returned sat
[2026-05-24 12:36:28] [INFO ] [Real]Absence check using state equation in 427 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:29] [INFO ] Deduced a trap composed of 79 places in 592 ms of which 119 ms to minimize.
[2026-05-24 12:36:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 36 ms returned sat
[2026-05-24 12:36:29] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2026-05-24 12:36:30] [INFO ] Computed and/alt/rep : 585/1578/585 causal constraints (skipped 70 transitions) in 74 ms.
[2026-05-24 12:36:34] [INFO ] Added : 300 causal constraints over 60 iterations in 4335 ms. Result :unknown
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:[1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 346 edges and 428 vertex of which 19 / 428 are part of one of the 3 SCC in 5 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 1083 edges and 412 vertex of which 406 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 406 transition count 512
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 125 rules applied. Total rules applied 251 place count 284 transition count 509
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 255 place count 282 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 257 place count 280 transition count 507
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 257 place count 280 transition count 499
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 273 place count 272 transition count 499
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 317 place count 228 transition count 453
Iterating global reduction 4 with 44 rules applied. Total rules applied 361 place count 228 transition count 453
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 363 place count 228 transition count 451
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 363 place count 228 transition count 439
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 387 place count 216 transition count 439
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 396 place count 207 transition count 388
Iterating global reduction 5 with 9 rules applied. Total rules applied 405 place count 207 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 409 place count 207 transition count 384
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 411 place count 206 transition count 383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 412 place count 205 transition count 383
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 68 rules applied. Total rules applied 480 place count 171 transition count 349
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 534 place count 144 transition count 415
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 540 place count 144 transition count 409
Drop transitions (Redundant composition of simpler transitions.) removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 9 with 27 rules applied. Total rules applied 567 place count 144 transition count 382
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 590 place count 144 transition count 359
Reduce places removed 23 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 619 place count 121 transition count 353
Drop transitions (Redundant composition of simpler transitions.) removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 10 with 47 rules applied. Total rules applied 666 place count 121 transition count 306
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 668 place count 121 transition count 306
Applied a total of 668 rules in 373 ms. Remains 121 /428 variables (removed 307) and now considering 306/656 (removed 350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 121/428 places, 306/656 transitions.
[2026-05-24 12:36:35] [INFO ] Flow matrix only has 272 transitions (discarded 34 similar events)
// Phase 1: matrix 272 rows 121 cols
[2026-05-24 12:36:35] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (57343 resets) in 2380 ms. (419 steps per ms)
FORMULA FireWire-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (14958 resets) in 809 ms. (1234 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:36:39] [INFO ] Flow matrix only has 272 transitions (discarded 34 similar events)
[2026-05-24 12:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:39] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:36:39] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2026-05-24 12:36:39] [INFO ] State equation strengthened by 60 read => feed constraints.
[2026-05-24 12:36:39] [INFO ] [Real]Added 60 Read/Feed constraints in 27 ms returned sat
[2026-05-24 12:36:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-24 12:36:39] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2026-05-24 12:36:39] [INFO ] [Nat]Added 60 Read/Feed constraints in 24 ms returned sat
[2026-05-24 12:36:39] [INFO ] Computed and/alt/rep : 125/660/125 causal constraints (skipped 143 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:40] [INFO ] Deduced a trap composed of 36 places in 220 ms of which 29 ms to minimize.
[2026-05-24 12:36:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2026-05-24 12:36:40] [INFO ] Added : 38 causal constraints over 8 iterations in 607 ms. Result :sat
Minimization took 250 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 121 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p271) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 305/305 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 304
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 120 transition count 303
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 119 transition count 303
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 116 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 19 place count 116 transition count 300
Applied a total of 19 rules in 25 ms. Remains 116 /121 variables (removed 5) and now considering 300/305 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 116/121 places, 300/305 transitions.
[2026-05-24 12:36:40] [INFO ] Flow matrix only has 264 transitions (discarded 36 similar events)
// Phase 1: matrix 264 rows 116 cols
[2026-05-24 12:36:40] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57479 resets) in 1896 ms. (527 steps per ms)
BEST_FIRST walk for 1000000 steps (14867 resets) in 593 ms. (1683 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:36:42] [INFO ] Flow matrix only has 264 transitions (discarded 36 similar events)
[2026-05-24 12:36:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:43] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2026-05-24 12:36:43] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-24 12:36:43] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:36:43] [INFO ] [Real]Added 62 Read/Feed constraints in 24 ms returned sat
[2026-05-24 12:36:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-24 12:36:43] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2026-05-24 12:36:43] [INFO ] [Nat]Added 62 Read/Feed constraints in 21 ms returned sat
[2026-05-24 12:36:43] [INFO ] Computed and/alt/rep : 114/647/114 causal constraints (skipped 146 transitions) in 29 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:43] [INFO ] Deduced a trap composed of 15 places in 177 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:43] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 6 ms to minimize.
[2026-05-24 12:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 336 ms
[2026-05-24 12:36:43] [INFO ] Added : 16 causal constraints over 5 iterations in 525 ms. Result :sat
Minimization took 214 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 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 300/300 transitions.
Applied a total of 0 rules in 12 ms. Remains 116 /116 variables (removed 0) and now considering 300/300 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 116/116 places, 300/300 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 300/300 transitions.
Applied a total of 0 rules in 12 ms. Remains 116 /116 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2026-05-24 12:36:44] [INFO ] Flow matrix only has 264 transitions (discarded 36 similar events)
[2026-05-24 12:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:36:44] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 12:36:44] [INFO ] Flow matrix only has 264 transitions (discarded 36 similar events)
[2026-05-24 12:36:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:36:44] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:36:45] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:36:45] [INFO ] Redundant transitions in 57 ms returned [270, 271]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 294 sub problems to find dead transitions.
[2026-05-24 12:36:45] [INFO ] Flow matrix only has 262 transitions (discarded 36 similar events)
// Phase 1: matrix 262 rows 116 cols
[2026-05-24 12:36:45] [INFO ] Computed 7 invariants in 11 ms
[2026-05-24 12:36:45] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:50] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:50] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:50] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:50] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:51] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:51] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 262/378 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 191 constraints, problems are : Problem set: 0 solved, 294 unsolved in 23645 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 262/378 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 294/485 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:29] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 26 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 486 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54061ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 54083ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 116/116 places, 298/300 transitions.
Applied a total of 0 rules in 11 ms. Remains 116 /116 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55074 ms. Remains : 116/116 places, 298/300 transitions.
[2026-05-24 12:37:39] [INFO ] Flow matrix only has 262 transitions (discarded 36 similar events)
[2026-05-24 12:37:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (57727 resets) in 2248 ms. (444 steps per ms)
BEST_FIRST walk for 1000001 steps (15011 resets) in 554 ms. (1801 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:37:42] [INFO ] Flow matrix only has 262 transitions (discarded 36 similar events)
[2026-05-24 12:37:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:37:42] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:37:42] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2026-05-24 12:37:42] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:37:42] [INFO ] [Real]Added 62 Read/Feed constraints in 40 ms returned sat
[2026-05-24 12:37:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:37:42] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:37:42] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-24 12:37:42] [INFO ] [Nat]Added 62 Read/Feed constraints in 31 ms returned sat
[2026-05-24 12:37:42] [INFO ] Computed and/alt/rep : 118/683/118 causal constraints (skipped 140 transitions) in 43 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:43] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:43] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 6 ms to minimize.
[2026-05-24 12:37:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 404 ms
[2026-05-24 12:37:43] [INFO ] Added : 17 causal constraints over 4 iterations in 691 ms. Result :sat
Minimization took 219 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 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 298/298 transitions.
Applied a total of 0 rules in 12 ms. Remains 116 /116 variables (removed 0) and now considering 298/298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 116/116 places, 298/298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 298/298 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 298/298 (removed 0) transitions.
[2026-05-24 12:37:43] [INFO ] Flow matrix only has 262 transitions (discarded 36 similar events)
[2026-05-24 12:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:37:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2026-05-24 12:37:43] [INFO ] Flow matrix only has 262 transitions (discarded 36 similar events)
[2026-05-24 12:37:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:37:43] [INFO ] State equation strengthened by 62 read => feed constraints.
[2026-05-24 12:37:44] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:37:44] [INFO ] Redundant transitions in 4 ms returned []
Running 294 sub problems to find dead transitions.
[2026-05-24 12:37:44] [INFO ] Flow matrix only has 262 transitions (discarded 36 similar events)
[2026-05-24 12:37:44] [INFO ] Invariant cache hit.
[2026-05-24 12:37:44] [INFO ] State equation strengthened by 62 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:47] [INFO ] Deduced a trap composed of 21 places in 180 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:48] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:48] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:48] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:48] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:49] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 262/378 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/378 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 191 constraints, problems are : Problem set: 0 solved, 294 unsolved in 17038 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 2/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 262/378 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 294/485 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/378 variables, and 485 constraints, problems are : Problem set: 0 solved, 294 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47170ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 47176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47935 ms. Remains : 116/116 places, 298/298 transitions.
RANDOM walk for 40000 steps (2325 resets) in 1134 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (608 resets) in 310 ms. (128 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (592 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
[2026-05-24 12:38:32] [INFO ] Flatten gal took : 182 ms
Finished probabilistic random walk after 4490 steps, run visited all 2 properties in 221 ms. (steps per millisecond=20 )
Probabilistic random walk after 4490 steps, saw 1612 distinct states, run finished after 228 ms. (steps per millisecond=19 ) properties seen :2
[2026-05-24 12:38:32] [INFO ] Flatten gal took : 110 ms
[2026-05-24 12:38:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1242232329527345938.gal : 22 ms
[2026-05-24 12:38:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12485414286435055213.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/ReachabilityCardinality1242232329527345938.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12485414286435055213.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
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)
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-17-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 162233 ms.

BK_STOP 1779626312519

--------------------
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="FireWire-PT-17"
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 FireWire-PT-17, 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 r143-smll-177955812400035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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