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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.9K Mar 7 05:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 05:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K 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.8K 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.2K Mar 15 10:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K 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 168K 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-18-UpperBounds-00
FORMULA_NAME FireWire-PT-18-UpperBounds-01
FORMULA_NAME FireWire-PT-18-UpperBounds-02
FORMULA_NAME FireWire-PT-18-UpperBounds-03
FORMULA_NAME FireWire-PT-18-UpperBounds-04
FORMULA_NAME FireWire-PT-18-UpperBounds-05
FORMULA_NAME FireWire-PT-18-UpperBounds-06
FORMULA_NAME FireWire-PT-18-UpperBounds-07
FORMULA_NAME FireWire-PT-18-UpperBounds-08
FORMULA_NAME FireWire-PT-18-UpperBounds-09
FORMULA_NAME FireWire-PT-18-UpperBounds-10
FORMULA_NAME FireWire-PT-18-UpperBounds-11
FORMULA_NAME FireWire-PT-18-UpperBounds-12
FORMULA_NAME FireWire-PT-18-UpperBounds-13
FORMULA_NAME FireWire-PT-18-UpperBounds-14
FORMULA_NAME FireWire-PT-18-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779626160944

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-24 12:36:03] [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:36:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:36:04] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2026-05-24 12:36:04] [INFO ] Transformed 437 places.
[2026-05-24 12:36:04] [INFO ] Transformed 707 transitions.
[2026-05-24 12:36:04] [INFO ] Found NUPN structural information;
[2026-05-24 12:36:04] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 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 707 rows 437 cols
[2026-05-24 12:36:04] [INFO ] Computed 9 invariants in 40 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (4 resets) in 94 ms. (105 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70000 steps (22 resets) in 223 ms. (312 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-24 12:36:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:05] [INFO ] [Real]Absence check using 9 positive place invariants in 36 ms returned sat
[2026-05-24 12:36:06] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:06] [INFO ] Deduced a trap composed of 28 places in 636 ms of which 78 ms to minimize.
[2026-05-24 12:36:07] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 32 ms returned sat
[2026-05-24 12:36:07] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:08] [INFO ] Deduced a trap composed of 98 places in 611 ms of which 136 ms to minimize.
[2026-05-24 12:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 758 ms
[2026-05-24 12:36:08] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 119 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:36:12] [INFO ] [Real]Absence check using 9 positive place invariants in 24 ms returned sat
[2026-05-24 12:36:12] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:13] [INFO ] Deduced a trap composed of 28 places in 610 ms of which 57 ms to minimize.
[2026-05-24 12:36:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-24 12:36:14] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:14] [INFO ] Deduced a trap composed of 61 places in 641 ms of which 102 ms to minimize.
[2026-05-24 12:36:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 748 ms
[2026-05-24 12:36:15] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 95 ms.
[2026-05-24 12:36:18] [INFO ] Added : 160 causal constraints over 32 iterations in 3608 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:18] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-24 12:36:19] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:19] [INFO ] Deduced a trap composed of 28 places in 580 ms of which 62 ms to minimize.
[2026-05-24 12:36:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:20] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-24 12:36:20] [INFO ] [Nat]Absence check using state equation in 453 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:21] [INFO ] Deduced a trap composed of 28 places in 544 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:21] [INFO ] Deduced a trap composed of 127 places in 614 ms of which 122 ms to minimize.
[2026-05-24 12:36:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1284 ms
[2026-05-24 12:36:22] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 95 ms.
[2026-05-24 12:36:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:25] [INFO ] [Real]Absence check using 9 positive place invariants in 23 ms returned sat
[2026-05-24 12:36:25] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:26] [INFO ] Deduced a trap composed of 28 places in 530 ms of which 65 ms to minimize.
[2026-05-24 12:36:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-24 12:36:27] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:27] [INFO ] Deduced a trap composed of 98 places in 590 ms of which 125 ms to minimize.
[2026-05-24 12:36:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 703 ms
[2026-05-24 12:36:28] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 184 ms.
[2026-05-24 12:36:31] [INFO ] Added : 195 causal constraints over 39 iterations in 3628 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:31] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2026-05-24 12:36:32] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2026-05-24 12:36:32] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 90 ms.
[2026-05-24 12:36:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 25 ms returned sat
[2026-05-24 12:36:33] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2026-05-24 12:36:33] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 80 ms.
[2026-05-24 12:36:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:37] [INFO ] [Real]Absence check using 9 positive place invariants in 18 ms returned sat
[2026-05-24 12:36:38] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:38] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 4 ms to minimize.
[2026-05-24 12:36:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 16 ms returned sat
[2026-05-24 12:36:38] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:39] [INFO ] Deduced a trap composed of 67 places in 563 ms of which 101 ms to minimize.
[2026-05-24 12:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 638 ms
[2026-05-24 12:36:39] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 71 ms.
[2026-05-24 12:36:43] [INFO ] Added : 215 causal constraints over 43 iterations in 3888 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:43] [INFO ] [Real]Absence check using 9 positive place invariants in 16 ms returned sat
[2026-05-24 12:36:43] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:44] [INFO ] Deduced a trap composed of 28 places in 524 ms of which 50 ms to minimize.
[2026-05-24 12:36:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-24 12:36:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 28 ms returned sat
[2026-05-24 12:36:45] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:45] [INFO ] Deduced a trap composed of 28 places in 553 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:46] [INFO ] Deduced a trap composed of 61 places in 540 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:47] [INFO ] Deduced a trap composed of 98 places in 629 ms of which 132 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:47] [INFO ] Deduced a trap composed of 128 places in 223 ms of which 33 ms to minimize.
[2026-05-24 12:36:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2180 ms
[2026-05-24 12:36:47] [INFO ] Computed and/alt/rep : 582/1525/582 causal constraints (skipped 124 transitions) in 85 ms.
[2026-05-24 12:36:49] [INFO ] Added : 115 causal constraints over 23 iterations in 2207 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FireWire-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA FireWire-PT-18-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 322 edges and 437 vertex of which 12 / 437 are part of one of the 3 SCC in 6 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 1269 edges and 428 vertex of which 418 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 418 transition count 609
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 172 place count 335 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 173 place count 334 transition count 607
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 173 place count 334 transition count 596
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 195 place count 323 transition count 596
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 256 place count 262 transition count 531
Iterating global reduction 3 with 61 rules applied. Total rules applied 317 place count 262 transition count 531
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 319 place count 262 transition count 529
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 319 place count 262 transition count 523
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 331 place count 256 transition count 523
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 351 place count 236 transition count 440
Iterating global reduction 4 with 20 rules applied. Total rules applied 371 place count 236 transition count 440
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 373 place count 236 transition count 438
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 379 place count 230 transition count 428
Iterating global reduction 5 with 6 rules applied. Total rules applied 385 place count 230 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 389 place count 230 transition count 424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 391 place count 228 transition count 424
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 393 place count 226 transition count 418
Iterating global reduction 7 with 2 rules applied. Total rules applied 395 place count 226 transition count 418
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 397 place count 224 transition count 414
Iterating global reduction 7 with 2 rules applied. Total rules applied 399 place count 224 transition count 414
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 401 place count 222 transition count 408
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 222 transition count 408
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 405 place count 220 transition count 404
Iterating global reduction 7 with 2 rules applied. Total rules applied 407 place count 220 transition count 404
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 409 place count 218 transition count 398
Iterating global reduction 7 with 2 rules applied. Total rules applied 411 place count 218 transition count 398
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 413 place count 216 transition count 394
Iterating global reduction 7 with 2 rules applied. Total rules applied 415 place count 216 transition count 394
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 417 place count 214 transition count 388
Iterating global reduction 7 with 2 rules applied. Total rules applied 419 place count 214 transition count 388
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 421 place count 212 transition count 384
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 212 transition count 384
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 424 place count 211 transition count 381
Iterating global reduction 7 with 1 rules applied. Total rules applied 425 place count 211 transition count 381
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 426 place count 210 transition count 379
Iterating global reduction 7 with 1 rules applied. Total rules applied 427 place count 210 transition count 379
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 428 place count 209 transition count 377
Iterating global reduction 7 with 1 rules applied. Total rules applied 429 place count 209 transition count 377
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 430 place count 208 transition count 375
Iterating global reduction 7 with 1 rules applied. Total rules applied 431 place count 208 transition count 375
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 7 with 68 rules applied. Total rules applied 499 place count 174 transition count 341
Performed 30 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 559 place count 144 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 561 place count 144 transition count 403
Free-agglomeration rule applied 16 times.
Iterating global reduction 7 with 16 rules applied. Total rules applied 577 place count 144 transition count 387
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 599 place count 128 transition count 381
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 603 place count 124 transition count 377
Iterating global reduction 8 with 4 rules applied. Total rules applied 607 place count 124 transition count 377
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 613 place count 124 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 631 place count 124 transition count 353
Applied a total of 631 rules in 487 ms. Remains 124 /437 variables (removed 313) and now considering 353/707 (removed 354) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 502 ms. Remains : 124/437 places, 353/707 transitions.
[2026-05-24 12:36:51] [INFO ] Flow matrix only has 346 transitions (discarded 7 similar events)
// Phase 1: matrix 346 rows 124 cols
[2026-05-24 12:36:51] [INFO ] Computed 7 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (50043 resets) in 1628 ms. (613 steps per ms)
FORMULA FireWire-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000001 steps (24800 resets) in 1067 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:36:54] [INFO ] Flow matrix only has 346 transitions (discarded 7 similar events)
[2026-05-24 12:36:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:54] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:36:54] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2026-05-24 12:36:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:36:55] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2026-05-24 12:36:55] [INFO ] State equation strengthened by 65 read => feed constraints.
[2026-05-24 12:36:55] [INFO ] [Nat]Added 65 Read/Feed constraints in 48 ms returned sat
[2026-05-24 12:36:55] [INFO ] Computed and/alt/rep : 148/832/148 causal constraints (skipped 194 transitions) in 46 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:55] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 5 ms to minimize.
[2026-05-24 12:36:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2026-05-24 12:36:55] [INFO ] Added : 30 causal constraints over 8 iterations in 527 ms. Result :sat
Minimization took 315 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:56] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:36:56] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-24 12:36:56] [INFO ] [Real]Added 65 Read/Feed constraints in 25 ms returned sat
[2026-05-24 12:36:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:36:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:36:56] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2026-05-24 12:36:56] [INFO ] [Nat]Added 65 Read/Feed constraints in 82 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:36:56] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 15 ms to minimize.
[2026-05-24 12:36:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2026-05-24 12:36:56] [INFO ] Computed and/alt/rep : 148/832/148 causal constraints (skipped 194 transitions) in 45 ms.
[2026-05-24 12:36:57] [INFO ] Added : 17 causal constraints over 4 iterations in 545 ms. Result :sat
Minimization took 274 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 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 353/353 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 124 transition count 352
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 123 transition count 352
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 122 transition count 349
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 122 transition count 349
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 121 transition count 348
Applied a total of 6 rules in 31 ms. Remains 121 /124 variables (removed 3) and now considering 348/353 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 121/124 places, 348/353 transitions.
[2026-05-24 12:36:57] [INFO ] Flow matrix only has 341 transitions (discarded 7 similar events)
// Phase 1: matrix 341 rows 121 cols
[2026-05-24 12:36:57] [INFO ] Computed 7 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (49942 resets) in 1868 ms. (535 steps per ms)
BEST_FIRST walk for 2000001 steps (24886 resets) in 1272 ms. (1571 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-24 12:37:00] [INFO ] Flow matrix only has 341 transitions (discarded 7 similar events)
[2026-05-24 12:37:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:37:00] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:37:01] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2026-05-24 12:37: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:37:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2026-05-24 12:37:01] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2026-05-24 12:37:01] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 12:37:01] [INFO ] [Nat]Added 64 Read/Feed constraints in 76 ms returned sat
[2026-05-24 12:37:01] [INFO ] Computed and/alt/rep : 144/827/144 causal constraints (skipped 193 transitions) in 58 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:01] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 6 ms to minimize.
[2026-05-24 12:37:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2026-05-24 12:37:01] [INFO ] Added : 21 causal constraints over 5 iterations in 440 ms. Result :sat
Minimization took 314 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:37:02] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:37:02] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2026-05-24 12:37:02] [INFO ] [Real]Added 64 Read/Feed constraints in 25 ms returned sat
[2026-05-24 12:37:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-24 12:37:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2026-05-24 12:37:02] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2026-05-24 12:37:02] [INFO ] [Nat]Added 64 Read/Feed constraints in 67 ms returned sat
[2026-05-24 12:37:02] [INFO ] Computed and/alt/rep : 144/827/144 causal constraints (skipped 193 transitions) in 56 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:03] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:03] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 25 ms to minimize.
[2026-05-24 12:37:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 549 ms
[2026-05-24 12:37:03] [INFO ] Added : 11 causal constraints over 3 iterations in 964 ms. Result :sat
Minimization took 301 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 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 348/348 transitions.
Applied a total of 0 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 348/348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 121/121 places, 348/348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 348/348 transitions.
Applied a total of 0 rules in 14 ms. Remains 121 /121 variables (removed 0) and now considering 348/348 (removed 0) transitions.
[2026-05-24 12:37:03] [INFO ] Flow matrix only has 341 transitions (discarded 7 similar events)
[2026-05-24 12:37:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:37:04] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-24 12:37:04] [INFO ] Flow matrix only has 341 transitions (discarded 7 similar events)
[2026-05-24 12:37:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-24 12:37:04] [INFO ] State equation strengthened by 64 read => feed constraints.
[2026-05-24 12:37:04] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-24 12:37:04] [INFO ] Redundant transitions in 26 ms returned []
Running 344 sub problems to find dead transitions.
[2026-05-24 12:37:04] [INFO ] Flow matrix only has 341 transitions (discarded 7 similar events)
[2026-05-24 12:37:04] [INFO ] Invariant cache hit.
[2026-05-24 12:37:04] [INFO ] State equation strengthened by 64 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:10] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:10] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:11] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:11] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:12] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 14 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (OVERLAPS) 341/462 variables, 121/133 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/197 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:37:29] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 13 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/462 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/462 variables, and 198 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 344 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 1 (OVERLAPS) 1/121 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 4 (OVERLAPS) 341/462 variables, 121/134 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 64/198 constraints. Problems are: Problem set: 0 solved, 344 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 344/542 constraints. Problems are: Problem set: 0 solved, 344 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 542 constraints, problems are : Problem set: 0 solved, 344 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 344/344 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60455ms problems are : Problem set: 0 solved, 344 unsolved
Search for dead transitions found 0 dead transitions in 60470ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61264 ms. Remains : 121/121 places, 348/348 transitions.
RANDOM walk for 40000 steps (2006 resets) in 1510 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (510 resets) in 658 ms. (60 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (501 resets) in 560 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (499 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (494 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
[2026-05-24 12:38:06] [INFO ] Flatten gal took : 106 ms
[2026-05-24 12:38:06] [INFO ] Flatten gal took : 41 ms
[2026-05-24 12:38:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality303041689667698752.gal : 24 ms
[2026-05-24 12:38:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13434911053589549076.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality303041689667698752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13434911053589549076.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality13434911053589549076.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :7 after 9
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :9 after 46
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :46 after 49
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :49 after 89
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :89 after 169
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :169 after 343
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :343 after 1482
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1482 after 3112
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3112 after 10325
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10325 after 35875
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :35875 after 88644
Interrupted probabilistic random walk after 411678 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :2 out of 4
Probabilistic random walk after 411678 steps, saw 115351 distinct states, run finished after 3007 ms. (steps per millisecond=136 ) properties seen :2
[2026-05-24 12:38:09] [INFO ] Flow matrix only has 341 transitions (discarded 7 similar events)
[2026-05-24 12:38:09] [INFO ] Invariant cache hit.
[2026-05-24 12:38:09] [INFO ] State equation strengthened by 64 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/113 variables, 6/7 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:38:09] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-24 12:38:09] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 341/454 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/462 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/462 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 194 constraints, problems are : Problem set: 0 solved, 2 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 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) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/113 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 341/454 variables, 113/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 64/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/462 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :88644 after 738774
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/462 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 196 constraints, problems are : Problem set: 0 solved, 2 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 121/121 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1068ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 22 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 8 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA FireWire-PT-18-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA FireWire-PT-18-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 126909 ms.

BK_STOP 1779626290572

--------------------
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-18"
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-18, 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-177955812400036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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