Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 359K 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 MedleyB-PT-B02-UpperBounds-00
FORMULA_NAME MedleyB-PT-B02-UpperBounds-01
FORMULA_NAME MedleyB-PT-B02-UpperBounds-02
FORMULA_NAME MedleyB-PT-B02-UpperBounds-03
FORMULA_NAME MedleyB-PT-B02-UpperBounds-04
FORMULA_NAME MedleyB-PT-B02-UpperBounds-05
FORMULA_NAME MedleyB-PT-B02-UpperBounds-06
FORMULA_NAME MedleyB-PT-B02-UpperBounds-07
FORMULA_NAME MedleyB-PT-B02-UpperBounds-08
FORMULA_NAME MedleyB-PT-B02-UpperBounds-09
FORMULA_NAME MedleyB-PT-B02-UpperBounds-10
FORMULA_NAME MedleyB-PT-B02-UpperBounds-11
FORMULA_NAME MedleyB-PT-B02-UpperBounds-12
FORMULA_NAME MedleyB-PT-B02-UpperBounds-13
FORMULA_NAME MedleyB-PT-B02-UpperBounds-14
FORMULA_NAME MedleyB-PT-B02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779942896867

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-28 04:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-28 04:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 04:34:58] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2026-05-28 04:34:58] [INFO ] Transformed 1227 places.
[2026-05-28 04:34:58] [INFO ] Transformed 1472 transitions.
[2026-05-28 04:34:58] [INFO ] Found NUPN structural information;
[2026-05-28 04:34:58] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 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 1472 rows 1227 cols
[2026-05-28 04:34:58] [INFO ] Computed 5 invariants in 27 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 (127 resets) in 50 ms. (196 steps per ms)
FORMULA MedleyB-PT-B02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (218 resets) in 92 ms. (860 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-28 04:34:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:34:59] [INFO ] [Real]Absence check using 5 positive place invariants in 24 ms returned sat
[2026-05-28 04:35:00] [INFO ] [Real]Absence check using state equation in 612 ms returned sat
[2026-05-28 04:35:00] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 72 ms.
[2026-05-28 04:35:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 34 ms returned sat
[2026-05-28 04:35:01] [INFO ] [Nat]Absence check using state equation in 570 ms returned sat
[2026-05-28 04:35:01] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 102 ms.
Maximisation of solution failed !
Minimization took 3 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:06] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2026-05-28 04:35:06] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:07] [INFO ] Deduced a trap composed of 396 places in 775 ms of which 342 ms to minimize.
[2026-05-28 04:35: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-28 04:35:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 27 ms returned sat
[2026-05-28 04:35:08] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:09] [INFO ] Deduced a trap composed of 396 places in 452 ms of which 154 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:10] [INFO ] Deduced a trap composed of 396 places in 800 ms of which 300 ms to minimize.
[2026-05-28 04:35:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1483 ms
[2026-05-28 04:35:10] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 143 ms.
[2026-05-28 04:35:12] [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-28 04:35:13] [INFO ] [Real]Absence check using 5 positive place invariants in 47 ms returned sat
[2026-05-28 04:35:13] [INFO ] [Real]Absence check using state equation in 729 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:14] [INFO ] Deduced a trap composed of 396 places in 667 ms of which 246 ms to minimize.
[2026-05-28 04:35:14] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2026-05-28 04:35:15] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:16] [INFO ] Deduced a trap composed of 396 places in 716 ms of which 249 ms to minimize.
[2026-05-28 04:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 870 ms
[2026-05-28 04:35:16] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 82 ms.
[2026-05-28 04:35:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:19] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2026-05-28 04:35:20] [INFO ] [Real]Absence check using state equation in 609 ms returned sat
[2026-05-28 04:35:20] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 70 ms.
[2026-05-28 04:35:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 36 ms returned sat
[2026-05-28 04:35:22] [INFO ] [Nat]Absence check using state equation in 573 ms returned sat
[2026-05-28 04:35:22] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 79 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:26] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2026-05-28 04:35:27] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:28] [INFO ] Deduced a trap composed of 395 places in 858 ms of which 369 ms to minimize.
[2026-05-28 04:35: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-28 04:35:28] [INFO ] [Nat]Absence check using 5 positive place invariants in 39 ms returned sat
[2026-05-28 04:35:29] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:30] [INFO ] Deduced a trap composed of 395 places in 1111 ms of which 460 ms to minimize.
[2026-05-28 04:35:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1247 ms
[2026-05-28 04:35:30] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 71 ms.
[2026-05-28 04:35:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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-28 04:35:33] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2026-05-28 04:35:34] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2026-05-28 04:35:34] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 82 ms.
[2026-05-28 04:35:34] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2026-05-28 04:35:35] [INFO ] [Nat]Absence check using state equation in 500 ms returned sat
[2026-05-28 04:35:35] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 145 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:40] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-28 04:35:40] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2026-05-28 04:35:40] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 71 ms.
[2026-05-28 04:35:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-28 04:35:41] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:42] [INFO ] Deduced a trap composed of 396 places in 756 ms of which 305 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:43] [INFO ] Deduced a trap composed of 396 places in 824 ms of which 349 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:43] [INFO ] Deduced a trap composed of 397 places in 288 ms of which 44 ms to minimize.
[2026-05-28 04:35:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2091 ms
[2026-05-28 04:35:44] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 64 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Maximisation of solution failed !
Minimization took 1 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:46] [INFO ] [Real]Absence check using 5 positive place invariants in 25 ms returned sat
[2026-05-28 04:35:47] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:47] [INFO ] Deduced a trap composed of 396 places in 372 ms of which 28 ms to minimize.
[2026-05-28 04:35:47] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-28 04:35:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-28 04:35:48] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-28 04:35:48] [INFO ] Deduced a trap composed of 396 places in 351 ms of which 20 ms to minimize.
[2026-05-28 04:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 544 ms
[2026-05-28 04:35:48] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 110 ms.
[2026-05-28 04:35:52] [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 7
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)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[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] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 1227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Graph (trivial) has 1203 edges and 1227 vertex of which 76 / 1227 are part of one of the 12 SCC in 8 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 1651 edges and 1163 vertex of which 1155 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.4 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 914 transitions
Trivial Post-agglo rules discarded 914 transitions
Performed 914 trivial Post agglomeration. Transition count delta: 914
Iterating post reduction 0 with 918 rules applied. Total rules applied 920 place count 1155 transition count 468
Reduce places removed 914 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 940 rules applied. Total rules applied 1860 place count 241 transition count 442
Reduce places removed 9 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 14 rules applied. Total rules applied 1874 place count 232 transition count 437
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 1879 place count 227 transition count 437
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 1879 place count 227 transition count 395
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1963 place count 185 transition count 395
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 2012 place count 136 transition count 346
Iterating global reduction 4 with 49 rules applied. Total rules applied 2061 place count 136 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2062 place count 136 transition count 345
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 2062 place count 136 transition count 343
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 2066 place count 134 transition count 343
Discarding 25 places :
Symmetric choice reduction at 5 with 25 rule applications. Total rules 2091 place count 109 transition count 189
Iterating global reduction 5 with 25 rules applied. Total rules applied 2116 place count 109 transition count 189
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 2128 place count 109 transition count 177
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2135 place count 102 transition count 170
Iterating global reduction 6 with 7 rules applied. Total rules applied 2142 place count 102 transition count 170
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 2148 place count 96 transition count 164
Iterating global reduction 6 with 6 rules applied. Total rules applied 2154 place count 96 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2160 place count 96 transition count 158
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 2186 place count 83 transition count 145
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2187 place count 83 transition count 144
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2191 place count 79 transition count 140
Iterating global reduction 8 with 4 rules applied. Total rules applied 2195 place count 79 transition count 140
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2199 place count 75 transition count 136
Iterating global reduction 8 with 4 rules applied. Total rules applied 2203 place count 75 transition count 136
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2207 place count 71 transition count 132
Iterating global reduction 8 with 4 rules applied. Total rules applied 2211 place count 71 transition count 132
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 2221 place count 66 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2222 place count 66 transition count 159
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2223 place count 66 transition count 158
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 9 with 22 rules applied. Total rules applied 2245 place count 66 transition count 129
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 2271 place count 44 transition count 125
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 2275 place count 40 transition count 121
Iterating global reduction 10 with 4 rules applied. Total rules applied 2279 place count 40 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2280 place count 40 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 11 with 24 rules applied. Total rules applied 2304 place count 40 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2306 place count 39 transition count 99
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 2309 place count 39 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2310 place count 39 transition count 98
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 2311 place count 39 transition count 98
Applied a total of 2311 rules in 162 ms. Remains 39 /1227 variables (removed 1188) and now considering 98/1472 (removed 1374) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 39/1227 places, 98/1472 transitions.
// Phase 1: matrix 98 rows 39 cols
[2026-05-28 04:35:52] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1428 ms. (699 steps per ms)
FORMULA MedleyB-PT-B02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (2 resets) in 346 ms. (2881 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2026-05-28 04:35:54] [INFO ] Flatten gal took : 42 ms
[2026-05-28 04:35:54] [INFO ] Flatten gal took : 14 ms
[2026-05-28 04:35:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6318766061801581226.gal : 7 ms
[2026-05-28 04:35:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5328057875829828847.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6318766061801581226.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5328057875829828847.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 56525 ms.

BK_STOP 1779942954943

--------------------
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="MedleyB-PT-B02"
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 MedleyB-PT-B02, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r191-oct2-177969025600037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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