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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.3K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 05:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 7 05:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 8.2K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 7 05:17 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 221K 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-19-UpperBounds-00
FORMULA_NAME FireWire-PT-19-UpperBounds-01
FORMULA_NAME FireWire-PT-19-UpperBounds-02
FORMULA_NAME FireWire-PT-19-UpperBounds-03
FORMULA_NAME FireWire-PT-19-UpperBounds-04
FORMULA_NAME FireWire-PT-19-UpperBounds-05
FORMULA_NAME FireWire-PT-19-UpperBounds-06
FORMULA_NAME FireWire-PT-19-UpperBounds-07
FORMULA_NAME FireWire-PT-19-UpperBounds-08
FORMULA_NAME FireWire-PT-19-UpperBounds-09
FORMULA_NAME FireWire-PT-19-UpperBounds-10
FORMULA_NAME FireWire-PT-19-UpperBounds-11
FORMULA_NAME FireWire-PT-19-UpperBounds-12
FORMULA_NAME FireWire-PT-19-UpperBounds-13
FORMULA_NAME FireWire-PT-19-UpperBounds-14
FORMULA_NAME FireWire-PT-19-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779626303228

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:38:25] [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:38:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:38:26] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2026-05-24 12:38:26] [INFO ] Transformed 602 places.
[2026-05-24 12:38:26] [INFO ] Transformed 944 transitions.
[2026-05-24 12:38:26] [INFO ] Found NUPN structural information;
[2026-05-24 12:38:26] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 516 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 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 944 rows 602 cols
[2026-05-24 12:38:26] [INFO ] Computed 13 invariants in 65 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 (9 resets) in 100 ms. (99 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120000 steps (47 resets) in 460 ms. (260 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[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]
[2026-05-24 12:38:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:38:28] [INFO ] [Real]Absence check using 13 positive place invariants in 39 ms returned sat
[2026-05-24 12:38:28] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2026-05-24 12:38:29] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 195 ms.
[2026-05-24 12:38:30] [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:38:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 38 ms returned sat
[2026-05-24 12:38:31] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:31] [INFO ] Deduced a trap composed of 103 places in 352 ms of which 34 ms to minimize.
[2026-05-24 12:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 526 ms
[2026-05-24 12:38:31] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 144 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:35] [INFO ] Deduced a trap composed of 17 places in 792 ms of which 62 ms to minimize.
[2026-05-24 12:38:35] [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.refineWithCausalOrder(DeadlockTester.java:1131)
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:38:36] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2026-05-24 12:38:36] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2026-05-24 12:38:36] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 116 ms.
[2026-05-24 12:38:37] [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:38:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 26 ms returned sat
[2026-05-24 12:38:37] [INFO ] [Nat]Absence check using state equation in 462 ms returned sat
[2026-05-24 12:38:38] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 100 ms.
[2026-05-24 12:38:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:38:42] [INFO ] [Real]Absence check using 13 positive place invariants in 33 ms returned sat
[2026-05-24 12:38:43] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2026-05-24 12:38:43] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 126 ms.
[2026-05-24 12:38:43] [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:38:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 23 ms returned sat
[2026-05-24 12:38:44] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2026-05-24 12:38:44] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 108 ms.
[2026-05-24 12:38:48] [INFO ] Added : 225 causal constraints over 45 iterations in 4264 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:38:49] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2026-05-24 12:38:49] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2026-05-24 12:38:50] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 110 ms.
[2026-05-24 12:38:50] [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:38:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 35 ms returned sat
[2026-05-24 12:38:51] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:51] [INFO ] Deduced a trap composed of 103 places in 277 ms of which 17 ms to minimize.
[2026-05-24 12:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 385 ms
[2026-05-24 12:38:51] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 98 ms.
[2026-05-24 12:38:55] [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:38:55] [INFO ] [Real]Absence check using 13 positive place invariants in 33 ms returned sat
[2026-05-24 12:38:56] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:56] [INFO ] Deduced a trap composed of 103 places in 221 ms of which 13 ms to minimize.
[2026-05-24 12:38:56] [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:38:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 33 ms returned sat
[2026-05-24 12:38:57] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:58] [INFO ] Deduced a trap composed of 103 places in 454 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:58] [INFO ] Deduced a trap composed of 103 places in 258 ms of which 14 ms to minimize.
[2026-05-24 12:38:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 879 ms
[2026-05-24 12:38:58] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 89 ms.
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:39:02] [INFO ] [Real]Absence check using 13 positive place invariants in 33 ms returned sat
[2026-05-24 12:39:02] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:03] [INFO ] Deduced a trap composed of 82 places in 628 ms of which 114 ms to minimize.
[2026-05-24 12:39:03] [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:39:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 31 ms returned sat
[2026-05-24 12:39:04] [INFO ] [Nat]Absence check using state equation in 559 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:05] [INFO ] Deduced a trap composed of 82 places in 616 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:05] [INFO ] Deduced a trap composed of 83 places in 692 ms of which 120 ms to minimize.
[2026-05-24 12:39:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1488 ms
[2026-05-24 12:39:06] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 100 ms.
[2026-05-24 12:39:08] [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.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:39:09] [INFO ] [Real]Absence check using 13 positive place invariants in 42 ms returned sat
[2026-05-24 12:39:09] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2026-05-24 12:39:09] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 92 ms.
[2026-05-24 12:39:10] [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:39:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 32 ms returned sat
[2026-05-24 12:39:11] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:11] [INFO ] Deduced a trap composed of 103 places in 268 ms of which 15 ms to minimize.
[2026-05-24 12:39:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2026-05-24 12:39:11] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 100 ms.
[2026-05-24 12:39:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:39:15] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2026-05-24 12:39:16] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2026-05-24 12:39:16] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 67 ms.
[2026-05-24 12:39: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:39:16] [INFO ] [Nat]Absence check using 13 positive place invariants in 22 ms returned sat
[2026-05-24 12:39:17] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:17] [INFO ] Deduced a trap composed of 17 places in 541 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:18] [INFO ] Deduced a trap composed of 121 places in 591 ms of which 122 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:19] [INFO ] Deduced a trap composed of 166 places in 722 ms of which 215 ms to minimize.
[2026-05-24 12:39:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2020 ms
[2026-05-24 12:39:19] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 80 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:39:21] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2026-05-24 12:39:22] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2026-05-24 12:39:22] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 93 ms.
[2026-05-24 12:39: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:39:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2026-05-24 12:39:23] [INFO ] [Nat]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:39:23] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 7 ms to minimize.
[2026-05-24 12:39:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2026-05-24 12:39:23] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 69 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:39:28] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2026-05-24 12:39:28] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:28] [INFO ] Deduced a trap composed of 103 places in 159 ms of which 9 ms to minimize.
[2026-05-24 12:39: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-24 12:39:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 21 ms returned sat
[2026-05-24 12:39:29] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:30] [INFO ] Deduced a trap composed of 82 places in 548 ms of which 136 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:30] [INFO ] Deduced a trap composed of 83 places in 696 ms of which 124 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:31] [INFO ] Deduced a trap composed of 103 places in 210 ms of which 12 ms to minimize.
[2026-05-24 12:39:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1656 ms
[2026-05-24 12:39:31] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 97 ms.
[2026-05-24 12:39:34] [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 9
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:39:34] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned sat
[2026-05-24 12:39:34] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:35] [INFO ] Deduced a trap composed of 82 places in 654 ms of which 149 ms to minimize.
[2026-05-24 12:39:35] [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:39:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 33 ms returned sat
[2026-05-24 12:39:36] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:36] [INFO ] Deduced a trap composed of 103 places in 269 ms of which 15 ms to minimize.
[2026-05-24 12:39:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2026-05-24 12:39:37] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 98 ms.
[2026-05-24 12:39:40] [INFO ] Added : 205 causal constraints over 41 iterations in 3777 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:39:40] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2026-05-24 12:39:41] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2026-05-24 12:39:41] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 116 ms.
[2026-05-24 12:39:42] [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:39:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 34 ms returned sat
[2026-05-24 12:39:42] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:43] [INFO ] Deduced a trap composed of 17 places in 638 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:44] [INFO ] Deduced a trap composed of 82 places in 790 ms of which 121 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:45] [INFO ] Deduced a trap composed of 121 places in 791 ms of which 161 ms to minimize.
[2026-05-24 12:39:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2424 ms
[2026-05-24 12:39:45] [INFO ] Computed and/alt/rep : 807/2024/807 causal constraints (skipped 136 transitions) in 122 ms.
[2026-05-24 12:39:47] [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 11
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)
Current structural bounds on expressions (after SMT) : Max Seen:[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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 12 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 944/944 transitions.
Graph (trivial) has 472 edges and 602 vertex of which 19 / 602 are part of one of the 3 SCC in 7 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 1585 edges and 586 vertex of which 577 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 577 transition count 754
Reduce places removed 167 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 170 rules applied. Total rules applied 342 place count 410 transition count 751
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 348 place count 408 transition count 747
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 352 place count 404 transition count 747
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 352 place count 404 transition count 735
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 376 place count 392 transition count 735
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 438 place count 330 transition count 670
Iterating global reduction 4 with 62 rules applied. Total rules applied 500 place count 330 transition count 670
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 503 place count 330 transition count 667
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 16 Pre rules applied. Total rules applied 503 place count 330 transition count 651
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 535 place count 314 transition count 651
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 546 place count 303 transition count 575
Iterating global reduction 5 with 11 rules applied. Total rules applied 557 place count 303 transition count 575
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 5 rules applied. Total rules applied 562 place count 303 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 564 place count 301 transition count 570
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 662 place count 252 transition count 521
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 742 place count 212 transition count 629
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 750 place count 212 transition count 621
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 790 place count 212 transition count 581
Free-agglomeration rule applied 33 times.
Iterating global reduction 8 with 33 rules applied. Total rules applied 823 place count 212 transition count 548
Reduce places removed 33 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 864 place count 179 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 76 transitions
Redundant transition composition rules discarded 76 transitions
Iterating global reduction 9 with 76 rules applied. Total rules applied 940 place count 179 transition count 464
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 943 place count 179 transition count 464
Applied a total of 943 rules in 416 ms. Remains 179 /602 variables (removed 423) and now considering 464/944 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 179/602 places, 464/944 transitions.
[2026-05-24 12:39:49] [INFO ] Flow matrix only has 409 transitions (discarded 55 similar events)
// Phase 1: matrix 409 rows 179 cols
[2026-05-24 12:39:49] [INFO ] Computed 10 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-19-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (40260 resets) in 2316 ms. (431 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-19-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (16418 resets) in 1265 ms. (1579 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:39:52] [INFO ] Flow matrix only has 409 transitions (discarded 55 similar events)
[2026-05-24 12:39:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:39:52] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-24 12:39:53] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2026-05-24 12:39:53] [INFO ] State equation strengthened by 88 read => feed constraints.
[2026-05-24 12:39:53] [INFO ] [Real]Added 88 Read/Feed constraints in 89 ms returned sat
[2026-05-24 12:39:53] [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:39:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2026-05-24 12:39:53] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2026-05-24 12:39:53] [INFO ] [Nat]Added 88 Read/Feed constraints in 159 ms returned sat
[2026-05-24 12:39:53] [INFO ] Computed and/alt/rep : 127/488/127 causal constraints (skipped 274 transitions) in 80 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:54] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:54] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 6 ms to minimize.
[2026-05-24 12:39:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 476 ms
[2026-05-24 12:39:54] [INFO ] Added : 20 causal constraints over 5 iterations in 859 ms. Result :sat
Minimization took 384 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:39:55] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-24 12:39:55] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2026-05-24 12:39:55] [INFO ] [Real]Added 88 Read/Feed constraints in 63 ms returned sat
[2026-05-24 12:39:55] [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:39:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 9 ms returned sat
[2026-05-24 12:39:55] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2026-05-24 12:39:55] [INFO ] [Nat]Added 88 Read/Feed constraints in 85 ms returned sat
[2026-05-24 12:39:55] [INFO ] Computed and/alt/rep : 127/488/127 causal constraints (skipped 274 transitions) in 74 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:56] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:39:56] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 6 ms to minimize.
[2026-05-24 12:39:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 453 ms
[2026-05-24 12:39:56] [INFO ] Added : 17 causal constraints over 6 iterations in 863 ms. Result :sat
Minimization took 385 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 464/464 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 0 with 2 rules applied. Total rules applied 2 place count 179 transition count 462
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 177 transition count 462
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 177 transition count 460
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 175 transition count 460
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 175 transition count 458
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 174 transition count 457
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 169 transition count 464
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 3 with 19 rules applied. Total rules applied 41 place count 169 transition count 445
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 169 transition count 444
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 45 place count 168 transition count 442
Applied a total of 45 rules in 98 ms. Remains 168 /179 variables (removed 11) and now considering 442/464 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 168/179 places, 442/464 transitions.
[2026-05-24 12:39:57] [INFO ] Flow matrix only has 389 transitions (discarded 53 similar events)
// Phase 1: matrix 389 rows 168 cols
[2026-05-24 12:39:57] [INFO ] Computed 10 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (41393 resets) in 2425 ms. (412 steps per ms)
FORMULA FireWire-PT-19-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (16926 resets) in 1354 ms. (1476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:40:01] [INFO ] Flow matrix only has 389 transitions (discarded 53 similar events)
[2026-05-24 12:40:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:40:01] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 12:40:01] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2026-05-24 12:40:01] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 12:40:01] [INFO ] [Real]Added 89 Read/Feed constraints in 47 ms returned sat
[2026-05-24 12:40:01] [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:40:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 12:40:01] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2026-05-24 12:40:01] [INFO ] [Nat]Added 89 Read/Feed constraints in 48 ms returned sat
[2026-05-24 12:40:01] [INFO ] Computed and/alt/rep : 111/461/111 causal constraints (skipped 270 transitions) in 32 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:02] [INFO ] Deduced a trap composed of 17 places in 213 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:02] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:02] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 19 ms to minimize.
[2026-05-24 12:40:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 548 ms
[2026-05-24 12:40:02] [INFO ] Added : 16 causal constraints over 6 iterations in 831 ms. Result :sat
Minimization took 274 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 168 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p99) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 441/441 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 168 transition count 440
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 167 transition count 440
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 167 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 166 transition count 439
Applied a total of 4 rules in 29 ms. Remains 166 /168 variables (removed 2) and now considering 439/441 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 166/168 places, 439/441 transitions.
[2026-05-24 12:40:02] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
// Phase 1: matrix 386 rows 166 cols
[2026-05-24 12:40:02] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (41394 resets) in 2019 ms. (495 steps per ms)
BEST_FIRST walk for 1000001 steps (8476 resets) in 569 ms. (1754 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2026-05-24 12:40:05] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:40:05] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 12:40:05] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2026-05-24 12:40:05] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 12:40:05] [INFO ] [Real]Added 89 Read/Feed constraints in 39 ms returned sat
[2026-05-24 12:40:05] [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:40:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2026-05-24 12:40:05] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-24 12:40:05] [INFO ] [Nat]Added 89 Read/Feed constraints in 69 ms returned sat
[2026-05-24 12:40:05] [INFO ] Computed and/alt/rep : 108/456/108 causal constraints (skipped 270 transitions) in 45 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:06] [INFO ] Deduced a trap composed of 17 places in 257 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:06] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:06] [INFO ] Deduced a trap composed of 25 places in 198 ms of which 25 ms to minimize.
[2026-05-24 12:40:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 674 ms
[2026-05-24 12:40:07] [INFO ] Added : 16 causal constraints over 5 iterations in 1211 ms. Result :sat
Minimization took 194 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 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 166 /166 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 166/166 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 166 /166 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2026-05-24 12:40:07] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:40:07] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-24 12:40:07] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:40:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:40:07] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 12:40:08] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1168 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:40:08] [INFO ] Redundant transitions in 50 ms returned []
Running 431 sub problems to find dead transitions.
[2026-05-24 12:40:08] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:40:08] [INFO ] Invariant cache hit.
[2026-05-24 12:40:08] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 2/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:17] [INFO ] Deduced a trap composed of 25 places in 212 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:17] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:17] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:17] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:18] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:19] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:20] [INFO ] Deduced a trap composed of 119 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:21] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:21] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 386/552 variables, 166/185 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 89/274 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:40:35] [INFO ] Deduced a trap composed of 125 places in 232 ms of which 24 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 275 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 2/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 386/552 variables, 166/186 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 89/275 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 431/706 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 706 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60644ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60670ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61933 ms. Remains : 166/166 places, 439/439 transitions.
RANDOM walk for 40000 steps (1685 resets) in 1127 ms. (35 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (325 resets) in 337 ms. (118 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (333 resets) in 390 ms. (102 steps per ms) remains 2/2 properties
[2026-05-24 12:41:09] [INFO ] Flatten gal took : 260 ms
[2026-05-24 12:41:10] [INFO ] Flatten gal took : 86 ms
[2026-05-24 12:41:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17455738911421944984.gal : 29 ms
[2026-05-24 12:41:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7168207504583976900.prop : 2 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/ReachabilityCardinality17455738911421944984.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7168207504583976900.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7168207504583976900.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 13
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :13 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 20
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :20 after 25
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :25 after 30
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :30 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 81
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :81 after 624
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :624 after 3850
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3850 after 9542
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :9542 after 14742
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :14742 after 41632
Interrupted probabilistic random walk after 444666 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 2
Probabilistic random walk after 444666 steps, saw 141065 distinct states, run finished after 3005 ms. (steps per millisecond=147 ) properties seen :0
[2026-05-24 12:41:12] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:41:12] [INFO ] Invariant cache hit.
[2026-05-24 12:41:12] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 116/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:13] [INFO ] Deduced a trap composed of 25 places in 215 ms of which 33 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :41632 after 105048
At refinement iteration 6 (OVERLAPS) 386/546 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 89/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/552 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 750 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 116/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:13] [INFO ] Deduced a trap composed of 35 places in 113 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:13] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 386/546 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 89/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/552 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/552 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 818 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1581ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 439/439 transitions.
Applied a total of 0 rules in 15 ms. Remains 166 /166 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 166/166 places, 439/439 transitions.
RANDOM walk for 40000 steps (1650 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (335 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (340 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :105048 after 216132
Interrupted probabilistic random walk after 466852 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 2
Probabilistic random walk after 466852 steps, saw 145140 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2026-05-24 12:41:17] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:41:17] [INFO ] Invariant cache hit.
[2026-05-24 12:41:17] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 116/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:18] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 386/546 variables, 160/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 89/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/552 variables, 6/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/552 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 266 constraints, problems are : Problem set: 0 solved, 2 unsolved in 526 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 116/160 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:18] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:18] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 386/546 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 89/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 6/552 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/552 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 552/552 variables, and 270 constraints, problems are : Problem set: 0 solved, 2 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1343ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 71 ms.
Support contains 1 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 439/439 transitions.
Applied a total of 0 rules in 12 ms. Remains 166 /166 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 166/166 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 439/439 transitions.
Applied a total of 0 rules in 11 ms. Remains 166 /166 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2026-05-24 12:41:19] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:41:19] [INFO ] Implicit Places using invariants in 265 ms returned []
[2026-05-24 12:41:19] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:41:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:41:19] [INFO ] State equation strengthened by 89 read => feed constraints.
[2026-05-24 12:41:20] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:41:20] [INFO ] Redundant transitions in 15 ms returned []
Running 431 sub problems to find dead transitions.
[2026-05-24 12:41:20] [INFO ] Flow matrix only has 386 transitions (discarded 53 similar events)
[2026-05-24 12:41:20] [INFO ] Invariant cache hit.
[2026-05-24 12:41:20] [INFO ] State equation strengthened by 89 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.20407e+06,14.5356,290148,2,16896,20,526348,6,0,1096,743993,0
Total reachable state count : 1204073

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,14.5397,290148,2,167,20,526348,7,0,1099,743993,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,14.5429,290148,2,167,20,526348,8,0,1100,743993,0
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 2/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:27] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:27] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:27] [INFO ] Deduced a trap composed of 56 places in 158 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:28] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:28] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:29] [INFO ] Deduced a trap composed of 47 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:41:30] [INFO ] Deduced a trap composed of 119 places in 172 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:31] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:31] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 386/552 variables, 166/185 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 89/274 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:41:42] [INFO ] Deduced a trap composed of 125 places in 220 ms of which 23 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 552/552 variables, and 275 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 431 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 1 (OVERLAPS) 2/166 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 4 (OVERLAPS) 386/552 variables, 166/186 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/552 variables, 89/275 constraints. Problems are: Problem set: 0 solved, 431 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/552 variables, 431/706 constraints. Problems are: Problem set: 0 solved, 431 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 706 constraints, problems are : Problem set: 0 solved, 431 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 166/166 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 431/431 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60336ms problems are : Problem set: 0 solved, 431 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61613 ms. Remains : 166/166 places, 439/439 transitions.
FORMULA FireWire-PT-19-UpperBounds-13 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 235125 ms.

BK_STOP 1779626540974

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

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