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.r127-smll-177955743800034.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 EisenbergMcGuire-PT-07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-177955743800034
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K Mar 7 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 7 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 05:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 7 05:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 09:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 09:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 09:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 09:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 05:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Mar 7 05:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 7 05:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 09:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 09:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 EisenbergMcGuire-PT-07-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779568862238

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 20:41:04] [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-23 20:41:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 20:41:04] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2026-05-23 20:41:04] [INFO ] Transformed 553 places.
[2026-05-23 20:41:04] [INFO ] Transformed 1960 transitions.
[2026-05-23 20:41:04] [INFO ] Found NUPN structural information;
[2026-05-23 20:41:04] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 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]
[2026-05-23 20:41:04] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2026-05-23 20:41:04] [INFO ] Computed 22 invariants in 30 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 (2 resets) in 89 ms. (111 steps per ms)
FORMULA EisenbergMcGuire-PT-07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 73 ms. (675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-23 20:41:05] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2026-05-23 20:41:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:05] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2026-05-23 20:41:05] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 9 ms returned sat
[2026-05-23 20:41:06] [INFO ] [Real]Absence check using state equation in 626 ms returned sat
[2026-05-23 20:41:06] [INFO ] State equation strengthened by 472 read => feed constraints.
[2026-05-23 20:41:06] [INFO ] [Real]Added 472 Read/Feed constraints in 134 ms returned sat
[2026-05-23 20:41:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 28 ms returned sat
[2026-05-23 20:41:07] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2026-05-23 20:41:07] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2026-05-23 20:41:07] [INFO ] [Nat]Added 472 Read/Feed constraints in 110 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:08] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:08] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:08] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:09] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:10] [INFO ] Deduced a trap composed of 3 places in 486 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:10] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:10] [INFO ] Deduced a trap composed of 20 places in 418 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:11] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:11] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:12] [INFO ] Deduced a trap composed of 3 places in 648 ms of which 19 ms to minimize.
[2026-05-23 20:41: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:12] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2026-05-23 20:41:12] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:12] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2026-05-23 20:41:13] [INFO ] [Real]Added 472 Read/Feed constraints in 132 ms returned sat
[2026-05-23 20:41: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-23 20:41:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 26 ms returned sat
[2026-05-23 20:41:13] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2026-05-23 20:41:13] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2026-05-23 20:41:13] [INFO ] [Nat]Added 472 Read/Feed constraints in 122 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:14] [INFO ] Deduced a trap composed of 3 places in 387 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:14] [INFO ] Deduced a trap composed of 3 places in 361 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:15] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:15] [INFO ] Deduced a trap composed of 20 places in 295 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:15] [INFO ] Deduced a trap composed of 29 places in 328 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:16] [INFO ] Deduced a trap composed of 3 places in 306 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:16] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:16] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:17] [INFO ] Deduced a trap composed of 3 places in 220 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:17] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 9 ms to minimize.
[2026-05-23 20:41:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 3378 ms
[2026-05-23 20:41:17] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 109 ms.
[2026-05-23 20:41:18] [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-23 20:41:18] [INFO ] [Real]Absence check using 15 positive place invariants in 25 ms returned sat
[2026-05-23 20:41:18] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:18] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2026-05-23 20:41:18] [INFO ] [Real]Added 472 Read/Feed constraints in 116 ms returned sat
[2026-05-23 20:41:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:19] [INFO ] [Nat]Absence check using 15 positive place invariants in 24 ms returned sat
[2026-05-23 20:41:19] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:19] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2026-05-23 20:41:19] [INFO ] [Nat]Added 472 Read/Feed constraints in 110 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:20] [INFO ] Deduced a trap composed of 3 places in 433 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:20] [INFO ] Deduced a trap composed of 3 places in 425 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:21] [INFO ] Deduced a trap composed of 23 places in 440 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:21] [INFO ] Deduced a trap composed of 3 places in 376 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:21] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:22] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:22] [INFO ] Deduced a trap composed of 20 places in 388 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:23] [INFO ] Deduced a trap composed of 26 places in 309 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:23] [INFO ] Deduced a trap composed of 32 places in 266 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:23] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 25 ms to minimize.
[2026-05-23 20:41:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4226 ms
[2026-05-23 20:41:24] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 123 ms.
[2026-05-23 20:41:24] [INFO ] Added : 0 causal constraints over 0 iterations in 125 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:24] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2026-05-23 20:41:24] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:24] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2026-05-23 20:41:24] [INFO ] [Real]Added 472 Read/Feed constraints in 124 ms returned sat
[2026-05-23 20:41:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2026-05-23 20:41:24] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:25] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2026-05-23 20:41:25] [INFO ] [Nat]Added 472 Read/Feed constraints in 101 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:25] [INFO ] Deduced a trap composed of 3 places in 455 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:26] [INFO ] Deduced a trap composed of 3 places in 464 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:27] [INFO ] Deduced a trap composed of 14 places in 492 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:27] [INFO ] Deduced a trap composed of 3 places in 465 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:28] [INFO ] Deduced a trap composed of 17 places in 511 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:28] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:29] [INFO ] Deduced a trap composed of 20 places in 432 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:29] [INFO ] Deduced a trap composed of 3 places in 394 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:29] [INFO ] Deduced a trap composed of 3 places in 313 ms of which 14 ms to minimize.
[2026-05-23 20:41:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:871)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:30] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2026-05-23 20:41:30] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:30] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2026-05-23 20:41:30] [INFO ] [Real]Added 472 Read/Feed constraints in 97 ms returned sat
[2026-05-23 20:41:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 20:41:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 25 ms returned sat
[2026-05-23 20:41:30] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2026-05-23 20:41:31] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2026-05-23 20:41:31] [INFO ] [Nat]Added 472 Read/Feed constraints in 79 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:31] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:31] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:32] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:32] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:32] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:33] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:33] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:33] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 14 ms to minimize.
[2026-05-23 20:41:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2498 ms
[2026-05-23 20:41:33] [INFO ] Computed and/alt/rep : 680/1520/554 causal constraints (skipped 440 transitions) in 105 ms.
[2026-05-23 20:41:35] [INFO ] Added : 90 causal constraints over 18 iterations in 1882 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-07-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 14 place count 546 transition count 1800
Deduced a syphon composed of 153 places in 3 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 320 place count 393 transition count 1800
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 362 place count 351 transition count 1506
Iterating global reduction 2 with 42 rules applied. Total rules applied 404 place count 351 transition count 1506
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 488 place count 309 transition count 1464
Applied a total of 488 rules in 320 ms. Remains 309 /553 variables (removed 244) and now considering 1464/1960 (removed 496) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 333 ms. Remains : 309/553 places, 1464/1960 transitions.
[2026-05-23 20:41:36] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
// Phase 1: matrix 505 rows 309 cols
[2026-05-23 20:41:36] [INFO ] Computed 22 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2307 ms. (433 steps per ms)
BEST_FIRST walk for 3000003 steps (6 resets) in 1987 ms. (1509 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2026-05-23 20:41:40] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-23 20:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:41] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2026-05-23 20:41:41] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 6 ms returned sat
[2026-05-23 20:41:41] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2026-05-23 20:41:41] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-23 20:41:41] [INFO ] [Real]Added 220 Read/Feed constraints in 36 ms returned sat
[2026-05-23 20:41:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2026-05-23 20:41:41] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2026-05-23 20:41:41] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2026-05-23 20:41:41] [INFO ] [Nat]Added 220 Read/Feed constraints in 43 ms returned sat
[2026-05-23 20:41:41] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 49 ms.
[2026-05-23 20:41:42] [INFO ] Added : 45 causal constraints over 9 iterations in 401 ms. Result :sat
Minimization took 147 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:42] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2026-05-23 20:41:42] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-23 20:41:42] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2026-05-23 20:41:42] [INFO ] [Real]Added 220 Read/Feed constraints in 52 ms returned sat
[2026-05-23 20:41:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2026-05-23 20:41:42] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-23 20:41:42] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2026-05-23 20:41:42] [INFO ] [Nat]Added 220 Read/Feed constraints in 45 ms returned sat
[2026-05-23 20:41:43] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 45 ms.
[2026-05-23 20:41:43] [INFO ] Added : 55 causal constraints over 11 iterations in 491 ms. Result :sat
Minimization took 155 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:43] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2026-05-23 20:41:43] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-23 20:41:43] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2026-05-23 20:41:43] [INFO ] [Real]Added 220 Read/Feed constraints in 47 ms returned sat
[2026-05-23 20:41:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2026-05-23 20:41:44] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-23 20:41:44] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2026-05-23 20:41:44] [INFO ] [Nat]Added 220 Read/Feed constraints in 46 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:44] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:44] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 3 ms to minimize.
[2026-05-23 20:41:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 222 ms
[2026-05-23 20:41:44] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 83 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:45] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 3 ms to minimize.
[2026-05-23 20:41:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2026-05-23 20:41:45] [INFO ] Added : 113 causal constraints over 23 iterations in 1320 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA EisenbergMcGuire-PT-07-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 75 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 309/309 places, 1464/1464 transitions.
[2026-05-23 20:41:46] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-23 20:41:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (2 resets) in 2186 ms. (457 steps per ms)
BEST_FIRST walk for 2000002 steps (4 resets) in 1138 ms. (1755 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-23 20:41:49] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-23 20:41:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:50] [INFO ] [Real]Absence check using 15 positive place invariants in 13 ms returned sat
[2026-05-23 20:41:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-23 20:41:50] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2026-05-23 20:41:50] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-23 20:41:50] [INFO ] [Real]Added 220 Read/Feed constraints in 47 ms returned sat
[2026-05-23 20:41:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2026-05-23 20:41:50] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-23 20:41:50] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2026-05-23 20:41:50] [INFO ] [Nat]Added 220 Read/Feed constraints in 45 ms returned sat
[2026-05-23 20:41:50] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 63 ms.
[2026-05-23 20:41:51] [INFO ] Added : 45 causal constraints over 9 iterations in 441 ms. Result :sat
Minimization took 153 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:51] [INFO ] [Real]Absence check using 15 positive place invariants in 12 ms returned sat
[2026-05-23 20:41:51] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2026-05-23 20:41:51] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2026-05-23 20:41:51] [INFO ] [Real]Added 220 Read/Feed constraints in 48 ms returned sat
[2026-05-23 20:41:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 20:41:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2026-05-23 20:41:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2026-05-23 20:41:51] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2026-05-23 20:41:52] [INFO ] [Nat]Added 220 Read/Feed constraints in 51 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:52] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:52] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 3 ms to minimize.
[2026-05-23 20:41:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 219 ms
[2026-05-23 20:41:52] [INFO ] Computed and/alt/rep : 436/1058/310 causal constraints (skipped 188 transitions) in 61 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:41:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 4 ms to minimize.
[2026-05-23 20:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2026-05-23 20:41:53] [INFO ] Added : 113 causal constraints over 23 iterations in 1242 ms. Result :sat
Minimization took 213 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 309 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 73 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 309/309 places, 1464/1464 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 309/309 places, 1464/1464 transitions.
Applied a total of 0 rules in 67 ms. Remains 309 /309 variables (removed 0) and now considering 1464/1464 (removed 0) transitions.
[2026-05-23 20:41:54] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-23 20:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:41:54] [INFO ] Implicit Places using invariants in 712 ms returned []
[2026-05-23 20:41:54] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-23 20:41:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 20:41:55] [INFO ] State equation strengthened by 220 read => feed constraints.
[2026-05-23 20:41:56] [INFO ] Implicit Places using invariants and state equation in 1950 ms returned []
Implicit Place search using SMT with State Equation took 2667 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 20:41:56] [INFO ] Redundant transitions in 114 ms returned []
Running 1457 sub problems to find dead transitions.
[2026-05-23 20:41:56] [INFO ] Flow matrix only has 505 transitions (discarded 959 similar events)
[2026-05-23 20:41:56] [INFO ] Invariant cache hit.
[2026-05-23 20:41:56] [INFO ] State equation strengthened by 220 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:09] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:10] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:10] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:10] [INFO ] Deduced a trap composed of 37 places in 203 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:10] [INFO ] Deduced a trap composed of 59 places in 195 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:11] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:12] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:12] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:12] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:13] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:13] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:13] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:13] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:14] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:14] [INFO ] Deduced a trap composed of 53 places in 268 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:14] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:15] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:15] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 25 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:18] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:20] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:24] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:25] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:27] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 309/814 variables, and 47 constraints, problems are : Problem set: 0 solved, 1457 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/309 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1457/1457 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1457 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/309 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/309 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 25/47 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:43] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:43] [INFO ] Deduced a trap composed of 17 places in 327 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:44] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:44] [INFO ] Deduced a trap composed of 21 places in 307 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:44] [INFO ] Deduced a trap composed of 23 places in 280 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:45] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:45] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:45] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:45] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:45] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:45] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:46] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:46] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:47] [INFO ] Deduced a trap composed of 53 places in 275 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:47] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:47] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:48] [INFO ] Deduced a trap composed of 51 places in 285 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:48] [INFO ] Deduced a trap composed of 51 places in 283 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:49] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:49] [INFO ] Deduced a trap composed of 51 places in 315 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 1457 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:52] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:53] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:54] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:55] [INFO ] Deduced a trap composed of 53 places in 212 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:55] [INFO ] Deduced a trap composed of 59 places in 252 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:56] [INFO ] Deduced a trap composed of 40 places in 224 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:56] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:57] [INFO ] Deduced a trap composed of 48 places in 244 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:57] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 20:42:57] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 13 ms to minimize.
SMT process timed out in 61113ms, After SMT, problems are : Problem set: 0 solved, 1457 unsolved
Search for dead transitions found 0 dead transitions in 61147ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64033 ms. Remains : 309/309 places, 1464/1464 transitions.
RANDOM walk for 40000 steps (8 resets) in 1336 ms. (29 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 4/4 properties
[2026-05-23 20:42:59] [INFO ] Flatten gal took : 595 ms
[2026-05-23 20:42:59] [INFO ] Flatten gal took : 259 ms
[2026-05-23 20:42:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16556747927148664929.gal : 82 ms
[2026-05-23 20:42:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1161973674554117826.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16556747927148664929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1161973674554117826.prop' '--nowitness' '--gen-order' 'FOLLOW'
Finished probabilistic random walk after 20230 steps, run visited all 4 properties in 581 ms. (steps per millisecond=34 )
Probabilistic random walk after 20230 steps, saw 14010 distinct states, run finished after 586 ms. (steps per millisecond=34 ) properties seen :4

ITS runner timed out or was interrupted.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:188)
at java.base/java.io.BufferedInputStream.read1(BufferedInputStream.java:343)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:420)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA EisenbergMcGuire-PT-07-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA EisenbergMcGuire-PT-07-UpperBounds-04 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 115324 ms.

BK_STOP 1779568979547

--------------------
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="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r127-smll-177955743800034"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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