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.r367-tall-178024404700027.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 SupplyChain-PT-00200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r367-tall-178024404700027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.6K May 27 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 27 07:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 27 07:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 27 10:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 27 10:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 12K May 27 07:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 27 07:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 27 07:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 27 07:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 27 10:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 27 10:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 6 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 820K May 26 18:17 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 SupplyChain-PT-00200-UpperBounds-00
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-01
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-02
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-03
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-04
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-05
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-06
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-07
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-08
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-09
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-10
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-11
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-12
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-13
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-14
FORMULA_NAME SupplyChain-PT-00200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1780305772784

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SupplyChain-PT-00200
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-06-01 09:22:54] [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-06-01 09:22:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 09:22:54] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2026-06-01 09:22:54] [INFO ] Transformed 2604 places.
[2026-06-01 09:22:54] [INFO ] Transformed 1603 transitions.
[2026-06-01 09:22:54] [INFO ] Parsed PT model containing 2604 places and 1603 transitions and 7206 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 1603 rows 2604 cols
[2026-06-01 09:22:54] [INFO ] Computed 1292 invariants in 242 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0] Max Struct:[2, 2, 2, 2, 2, 1081, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
RANDOM walk for 10000 steps (12 resets) in 379 ms. (26 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 1060 ms. (150 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1] Max Struct:[2, 2, 2, 2, 2, 1081, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
[2026-06-01 09:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:22:56] [INFO ] [Real]Absence check using 491 positive place invariants in 155 ms returned sat
[2026-06-01 09:22:56] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 152 ms returned sat
[2026-06-01 09:22:57] [INFO ] [Real]Absence check using state equation in 477 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:22:57] [INFO ] [Real]Absence check using 491 positive place invariants in 120 ms returned sat
[2026-06-01 09:22:58] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 156 ms returned sat
[2026-06-01 09:22:58] [INFO ] [Real]Absence check using state equation in 430 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:22:58] [INFO ] [Real]Absence check using 491 positive place invariants in 119 ms returned sat
[2026-06-01 09:22:58] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 148 ms returned sat
[2026-06-01 09:22:59] [INFO ] [Real]Absence check using state equation in 440 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:22:59] [INFO ] [Real]Absence check using 491 positive place invariants in 124 ms returned sat
[2026-06-01 09:22:59] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 134 ms returned sat
[2026-06-01 09:23:00] [INFO ] [Real]Absence check using state equation in 407 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:00] [INFO ] [Real]Absence check using 491 positive place invariants in 110 ms returned sat
[2026-06-01 09:23:00] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 144 ms returned sat
[2026-06-01 09:23:01] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2026-06-01 09:23:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-06-01 09:23:01] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2026-06-01 09:23:02] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 90 ms.
[2026-06-01 09:23:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:03] [INFO ] [Nat]Absence check using 491 positive place invariants in 129 ms returned sat
[2026-06-01 09:23:03] [INFO ] [Nat]Absence check using 491 positive and 801 generalized place invariants in 136 ms returned sat
[2026-06-01 09:23:04] [INFO ] [Nat]Absence check using state equation in 876 ms returned sat
[2026-06-01 09:23:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-06-01 09:23:04] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 95 ms.
[2026-06-01 09:23:07] [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-06-01 09:23:08] [INFO ] [Real]Absence check using 491 positive place invariants in 120 ms returned sat
[2026-06-01 09:23:08] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 152 ms returned sat
[2026-06-01 09:23:09] [INFO ] [Real]Absence check using state equation in 928 ms returned sat
[2026-06-01 09:23:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:23:10] [INFO ] Deduced a trap composed of 91 places in 822 ms of which 138 ms to minimize.
[2026-06-01 09:23:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 900 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:10] [INFO ] [Real]Absence check using 491 positive place invariants in 126 ms returned sat
[2026-06-01 09:23:10] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 151 ms returned sat
[2026-06-01 09:23:11] [INFO ] [Real]Absence check using state equation in 469 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:11] [INFO ] [Real]Absence check using 491 positive place invariants in 112 ms returned sat
[2026-06-01 09:23:11] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 144 ms returned sat
[2026-06-01 09:23:12] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2026-06-01 09:23:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-06-01 09:23:13] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 141 ms.
[2026-06-01 09:23:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:14] [INFO ] [Nat]Absence check using 491 positive place invariants in 111 ms returned sat
[2026-06-01 09:23:14] [INFO ] [Nat]Absence check using 491 positive and 801 generalized place invariants in 139 ms returned sat
[2026-06-01 09:23:15] [INFO ] [Nat]Absence check using state equation in 835 ms returned sat
[2026-06-01 09:23:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-06-01 09:23:15] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 71 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:19] [INFO ] [Real]Absence check using 491 positive place invariants in 108 ms returned sat
[2026-06-01 09:23:19] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 134 ms returned sat
[2026-06-01 09:23:20] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2026-06-01 09:23:20] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2026-06-01 09:23:20] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 67 ms.
[2026-06-01 09:23:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:21] [INFO ] [Nat]Absence check using 491 positive place invariants in 110 ms returned sat
[2026-06-01 09:23:21] [INFO ] [Nat]Absence check using 491 positive and 801 generalized place invariants in 140 ms returned sat
[2026-06-01 09:23:22] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2026-06-01 09:23:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-06-01 09:23:22] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 66 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:26] [INFO ] [Real]Absence check using 491 positive place invariants in 111 ms returned sat
[2026-06-01 09:23:26] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 152 ms returned sat
[2026-06-01 09:23:26] [INFO ] [Real]Absence check using state equation in 418 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:27] [INFO ] [Real]Absence check using 491 positive place invariants in 111 ms returned sat
[2026-06-01 09:23:27] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 142 ms returned sat
[2026-06-01 09:23:27] [INFO ] [Real]Absence check using state equation in 435 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:28] [INFO ] [Real]Absence check using 491 positive place invariants in 115 ms returned sat
[2026-06-01 09:23:28] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 140 ms returned sat
[2026-06-01 09:23:29] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2026-06-01 09:23:29] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-06-01 09:23:29] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 81 ms.
[2026-06-01 09:23:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:30] [INFO ] [Nat]Absence check using 491 positive place invariants in 120 ms returned sat
[2026-06-01 09:23:30] [INFO ] [Nat]Absence check using 491 positive and 801 generalized place invariants in 153 ms returned sat
[2026-06-01 09:23:31] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2026-06-01 09:23:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-06-01 09:23:31] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 77 ms.
[2026-06-01 09:23:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:301)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1140)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:878)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2254)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:927)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:35] [INFO ] [Real]Absence check using 491 positive place invariants in 118 ms returned sat
[2026-06-01 09:23:35] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 155 ms returned sat
[2026-06-01 09:23:35] [INFO ] [Real]Absence check using state equation in 463 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:36] [INFO ] [Real]Absence check using 491 positive place invariants in 111 ms returned sat
[2026-06-01 09:23:36] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 144 ms returned sat
[2026-06-01 09:23:37] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2026-06-01 09:23:37] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-06-01 09:23:37] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 76 ms.
[2026-06-01 09:23:38] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:38] [INFO ] [Nat]Absence check using 491 positive place invariants in 101 ms returned sat
[2026-06-01 09:23:38] [INFO ] [Nat]Absence check using 491 positive and 801 generalized place invariants in 125 ms returned sat
[2026-06-01 09:23:39] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2026-06-01 09:23:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-06-01 09:23:39] [INFO ] Computed and/alt/rep : 1402/3202/1402 causal constraints (skipped 1 transitions) in 76 ms.
Maximisation of solution failed !
Minimization took 0 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:43] [INFO ] [Real]Absence check using 491 positive place invariants in 116 ms returned sat
[2026-06-01 09:23:43] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 150 ms returned sat
[2026-06-01 09:23:44] [INFO ] [Real]Absence check using state equation in 468 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-06-01 09:23:44] [INFO ] [Real]Absence check using 491 positive place invariants in 112 ms returned sat
[2026-06-01 09:23:44] [INFO ] [Real]Absence check using 491 positive and 801 generalized place invariants in 144 ms returned sat
[2026-06-01 09:23:45] [INFO ] [Real]Absence check using state equation in 426 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1] Max Struct:[1, 1, 1, 1, 2, 0, 1, 2, 2, 1, 1, 2, 1, 2, 1, 1]
FORMULA SupplyChain-PT-00200-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[2, 2, 2, 2, 2]
Support contains 5 out of 2604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2604/2604 places, 1603/1603 transitions.
Graph (complete) has 7162 edges and 2604 vertex of which 2602 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 690 places
Iterating post reduction 0 with 690 rules applied. Total rules applied 691 place count 1912 transition count 1601
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 691 place count 1912 transition count 1401
Deduced a syphon composed of 200 places in 2 ms
Ensure Unique test removed 200 places
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 1 with 600 rules applied. Total rules applied 1291 place count 1512 transition count 1401
Free-agglomeration rule applied 310 times.
Iterating global reduction 1 with 310 rules applied. Total rules applied 1601 place count 1512 transition count 1091
Ensure Unique test removed 200 places
Reduce places removed 510 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 910 rules applied. Total rules applied 2511 place count 1002 transition count 691
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 2711 place count 802 transition count 691
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 2711 place count 802 transition count 491
Deduced a syphon composed of 200 places in 0 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 3111 place count 602 transition count 491
Free-agglomeration rule (complex) applied 86 times.
Iterating global reduction 3 with 86 rules applied. Total rules applied 3197 place count 602 transition count 405
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 3 with 86 rules applied. Total rules applied 3283 place count 516 transition count 405
Applied a total of 3283 rules in 435 ms. Remains 516 /2604 variables (removed 2088) and now considering 405/1603 (removed 1198) transitions.
Running 201 sub problems to find dead transitions.
// Phase 1: matrix 405 rows 516 cols
[2026-06-01 09:23:45] [INFO ] Computed 201 invariants in 4 ms
[2026-06-01 09:23:45] [INFO ] State equation strengthened by 86 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 1/1 constraints. Problems are: Problem set: 110 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 196/197 constraints. Problems are: Problem set: 110 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-06-01 09:23:47] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/512 variables, 1/198 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 0/198 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/516 variables, 4/202 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/202 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 405/921 variables, 516/718 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 86/804 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 0/804 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/921 variables, 0/804 constraints. Problems are: Problem set: 200 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 921/921 variables, and 804 constraints, problems are : Problem set: 200 solved, 1 unsolved in 1454 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 516/516 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 201/200 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 200 solved, 1 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 204/405 variables, 200/200 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 0/200 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/516 variables, 1/201 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 1/202 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 0/202 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 405/921 variables, 516/718 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/921 variables, 86/804 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/921 variables, 0/804 constraints. Problems are: Problem set: 200 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/921 variables, 0/804 constraints. Problems are: Problem set: 200 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 921/921 variables, and 804 constraints, problems are : Problem set: 200 solved, 1 unsolved in 335 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 200/200 constraints, State Equation: 516/516 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 1/200 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2073ms problems are : Problem set: 200 solved, 1 unsolved
Search for dead transitions found 200 dead transitions in 2082ms
Found 200 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 200 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 516/2604 places, 205/1603 transitions.
Graph (complete) has 408 edges and 516 vertex of which 406 are kept as prefixes of interest. Removing 110 places using SCC suffix rule.0 ms
Discarding 110 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 406 /516 variables (removed 110) and now considering 205/205 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2544 ms. Remains : 406/2604 places, 205/1603 transitions.
// Phase 1: matrix 205 rows 406 cols
[2026-06-01 09:23:47] [INFO ] Computed 201 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 2, 1, 1, 1]
RANDOM walk for 1000000 steps (18253 resets) in 13398 ms. (74 steps per ms)
FORMULA SupplyChain-PT-00200-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SupplyChain-PT-00200-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (4854 resets) in 2814 ms. (355 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[2]
[2026-06-01 09:24:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-06-01 09:24:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2026-06-01 09:24:04] [INFO ] [Real]Absence check using 1 positive and 200 generalized place invariants in 29 ms returned sat
[2026-06-01 09:24:04] [INFO ] [Real]Absence check using state equation in 24 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA SupplyChain-PT-00200-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 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-06-01 09:24:04] [INFO ] Flatten gal took : 79 ms
[2026-06-01 09:24:04] [INFO ] Flatten gal took : 33 ms
[2026-06-01 09:24:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9161475819919627046.gal : 15 ms
[2026-06-01 09:24:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14195011805644565782.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/ReachabilityCardinality9161475819919627046.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14195011805644565782.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 70296 ms.

BK_STOP 1780305844459

--------------------
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="SupplyChain-PT-00200"
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 SupplyChain-PT-00200, 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 r367-tall-178024404700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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