Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 6.9K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 231K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B01-UpperBounds-00
FORMULA_NAME MedleyB-PT-B01-UpperBounds-01
FORMULA_NAME MedleyB-PT-B01-UpperBounds-02
FORMULA_NAME MedleyB-PT-B01-UpperBounds-03
FORMULA_NAME MedleyB-PT-B01-UpperBounds-04
FORMULA_NAME MedleyB-PT-B01-UpperBounds-05
FORMULA_NAME MedleyB-PT-B01-UpperBounds-06
FORMULA_NAME MedleyB-PT-B01-UpperBounds-07
FORMULA_NAME MedleyB-PT-B01-UpperBounds-08
FORMULA_NAME MedleyB-PT-B01-UpperBounds-09
FORMULA_NAME MedleyB-PT-B01-UpperBounds-10
FORMULA_NAME MedleyB-PT-B01-UpperBounds-11
FORMULA_NAME MedleyB-PT-B01-UpperBounds-12
FORMULA_NAME MedleyB-PT-B01-UpperBounds-13
FORMULA_NAME MedleyB-PT-B01-UpperBounds-14
FORMULA_NAME MedleyB-PT-B01-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779704807854

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B01
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 10:26:49] [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-25 10:26:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:26:50] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2026-05-25 10:26:50] [INFO ] Transformed 925 places.
[2026-05-25 10:26:50] [INFO ] Transformed 1037 transitions.
[2026-05-25 10:26:50] [INFO ] Found NUPN structural information;
[2026-05-25 10:26:50] [INFO ] Parsed PT model containing 925 places and 1037 transitions and 2433 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16830728869041922217.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7053457212639732065.kers'
[2026-05-25 10:26:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16830728869041922217.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7053457212639732065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1037 rows 925 cols 2433 entries
Finished phase 1 with 921 SingleSign rule and 0 generalized
[2026-05-25 10:26:50] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7053457212639732065.kers
Total runtime 5 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 (164 resets) in 72 ms. (136 steps per ms)
FORMULA MedleyB-PT-B01-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (287 resets) in 86 ms. (804 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-25 10:26:50] [INFO ] Invariant cache hit.
[2026-05-25 10:26:50] [INFO ] [Real]Absence check using 4 positive place invariants in 43 ms returned sat
[2026-05-25 10:26:51] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2026-05-25 10:26:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:26:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 25 ms returned sat
[2026-05-25 10:26:53] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2026-05-25 10:26:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1391 ms
[2026-05-25 10:26:54] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 104 ms.
[2026-05-25 10:26:57] [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:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:26:57] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2026-05-25 10:26:58] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2026-05-25 10:26:58] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 85 ms.
[2026-05-25 10:26:58] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:26:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2026-05-25 10:26:59] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2026-05-25 10:26:59] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 84 ms.
[2026-05-25 10:27:03] [INFO ] Added : 310 causal constraints over 62 iterations in 4350 ms. Result :unknown
[2026-05-25 10:27:03] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2026-05-25 10:27:04] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2026-05-25 10:27:05] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:27:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2026-05-25 10:27:06] [INFO ] [Nat]Absence check using state equation in 785 ms returned sat
[2026-05-25 10:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 784 ms
[2026-05-25 10:27:07] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 72 ms.
[2026-05-25 10:27:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:27:10] [INFO ] [Real]Absence check using 4 positive place invariants in 38 ms returned sat
[2026-05-25 10:27:10] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2026-05-25 10:27:11] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:27:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 27 ms returned sat
[2026-05-25 10:27:12] [INFO ] [Nat]Absence check using state equation in 306 ms returned sat
[2026-05-25 10:27:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 748 ms
[2026-05-25 10:27:13] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 96 ms.
[2026-05-25 10:27:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Timeout of Z3 solver reached")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:27:17] [INFO ] [Real]Absence check using 4 positive place invariants in 30 ms returned sat
[2026-05-25 10:27:17] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2026-05-25 10:27:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:27:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 15 ms returned sat
[2026-05-25 10:27:19] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2026-05-25 10:27:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 701 ms
[2026-05-25 10:27:19] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 67 ms.
[2026-05-25 10:27:23] [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:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:27:23] [INFO ] [Real]Absence check using 4 positive place invariants in 13 ms returned sat
[2026-05-25 10:27:23] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2026-05-25 10:27:24] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:27:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2026-05-25 10:27:25] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2026-05-25 10:27:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 796 ms
[2026-05-25 10:27:26] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 111 ms.
[2026-05-25 10:27: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 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
[2026-05-25 10:27:29] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2026-05-25 10:27:30] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2026-05-25 10:27:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:27:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2026-05-25 10:27:31] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2026-05-25 10:27:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1260 ms
[2026-05-25 10:27:33] [INFO ] Computed and/alt/rep : 995/1451/995 causal constraints (skipped 41 transitions) in 40 ms.
[2026-05-25 10:27:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1143)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:881)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2280)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:207)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:803)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
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:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 925 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 925/925 places, 1037/1037 transitions.
Graph (trivial) has 906 edges and 925 vertex of which 60 / 925 are part of one of the 9 SCC in 9 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Graph (complete) has 1173 edges and 874 vertex of which 868 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 685 transitions
Trivial Post-agglo rules discarded 685 transitions
Performed 685 trivial Post agglomeration. Transition count delta: 685
Iterating post reduction 0 with 688 rules applied. Total rules applied 690 place count 868 transition count 280
Reduce places removed 685 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 708 rules applied. Total rules applied 1398 place count 183 transition count 257
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 1411 place count 174 transition count 253
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1415 place count 170 transition count 253
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 1415 place count 170 transition count 223
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 1475 place count 140 transition count 223
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 1512 place count 103 transition count 186
Iterating global reduction 4 with 37 rules applied. Total rules applied 1549 place count 103 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1549 place count 103 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1551 place count 102 transition count 185
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1570 place count 83 transition count 129
Iterating global reduction 4 with 19 rules applied. Total rules applied 1589 place count 83 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1597 place count 83 transition count 121
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1602 place count 78 transition count 116
Iterating global reduction 5 with 5 rules applied. Total rules applied 1607 place count 78 transition count 116
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1611 place count 74 transition count 112
Iterating global reduction 5 with 4 rules applied. Total rules applied 1615 place count 74 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1619 place count 74 transition count 108
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1637 place count 65 transition count 99
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1638 place count 65 transition count 98
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1641 place count 62 transition count 95
Iterating global reduction 7 with 3 rules applied. Total rules applied 1644 place count 62 transition count 95
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1646 place count 60 transition count 93
Iterating global reduction 7 with 2 rules applied. Total rules applied 1648 place count 60 transition count 93
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1650 place count 58 transition count 91
Iterating global reduction 7 with 2 rules applied. Total rules applied 1652 place count 58 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1658 place count 55 transition count 107
Free-agglomeration rule applied 19 times with reduction of 3 identical transitions.
Iterating global reduction 7 with 19 rules applied. Total rules applied 1677 place count 55 transition count 85
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1706 place count 36 transition count 75
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1709 place count 33 transition count 72
Iterating global reduction 8 with 3 rules applied. Total rules applied 1712 place count 33 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1713 place count 33 transition count 71
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 1731 place count 33 transition count 53
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1734 place count 33 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 1736 place count 33 transition count 51
Applied a total of 1736 rules in 112 ms. Remains 33 /925 variables (removed 892) and now considering 51/1037 (removed 986) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 33/925 places, 51/1037 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17330619142584215932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1768802066347947502.kers'
[2026-05-25 10:27:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17330619142584215932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1768802066347947502.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 51 rows 32 cols 150 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 10:27:36] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1768802066347947502.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 807 ms. (1237 steps per ms)
FORMULA MedleyB-PT-B01-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B01-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 334 ms. (2985 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 47913 ms.

BK_STOP 1779704857733

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyB-PT-B01"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MedleyB-PT-B01, 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 r178-oct2-177969020000285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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