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.r034-tall-177946842000525.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 itstools
Input is BusinessProcesses-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000525
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 131K 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 BusinessProcesses-PT-10-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779616826876

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-24 10:00:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 10:00:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:00:28] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2026-05-24 10:00:28] [INFO ] Transformed 518 places.
[2026-05-24 10:00:28] [INFO ] Transformed 471 transitions.
[2026-05-24 10:00:28] [INFO ] Found NUPN structural information;
[2026-05-24 10:00:28] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 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-7766609799938508826.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9925833988837722039.kers'
[2026-05-24 10:00:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7766609799938508826.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9925833988837722039.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 471 rows 518 cols 1415 entries
Finished phase 1 with 367 SingleSign rule and 66 generalized
[2026-05-24 10:00:28] [INFO ] Computed 85 invariants in 2 ms
Computed 85 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9925833988837722039.kers
Total runtime 3 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 (81 resets) in 55 ms. (178 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70003 steps (98 resets) in 90 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
[2026-05-24 10:00:28] [INFO ] Invariant cache hit.
[2026-05-24 10:00:28] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2026-05-24 10:00:28] [INFO ] [Real]Absence check using 63 positive and 22 generalized place invariants in 22 ms returned sat
[2026-05-24 10:00:28] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2026-05-24 10:00:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 10:00:29] [INFO ] [Nat]Absence check using 63 positive place invariants in 26 ms returned sat
[2026-05-24 10:00:29] [INFO ] [Nat]Absence check using 63 positive and 22 generalized place invariants in 18 ms returned sat
[2026-05-24 10:00:29] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-24 10:00:31] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1706 ms
[2026-05-24 10:00:31] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 33 ms.
[2026-05-24 10:00: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 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-24 10:00:34] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2026-05-24 10:00:34] [INFO ] [Real]Absence check using 63 positive and 22 generalized place invariants in 20 ms returned sat
[2026-05-24 10:00:34] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2026-05-24 10:00:34] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 10:00:34] [INFO ] [Nat]Absence check using 63 positive place invariants in 23 ms returned sat
[2026-05-24 10:00:34] [INFO ] [Nat]Absence check using 63 positive and 22 generalized place invariants in 20 ms returned sat
[2026-05-24 10:00:35] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2026-05-24 10:00:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2284 ms
[2026-05-24 10:00:37] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 22 ms.
[2026-05-24 10:00:39] [INFO ] Added : 269 causal constraints over 54 iterations in 1934 ms. Result :sat
Minimization took 304 ms.
[2026-05-24 10:00:39] [INFO ] [Real]Absence check using 63 positive place invariants in 20 ms returned sat
[2026-05-24 10:00:39] [INFO ] [Real]Absence check using 63 positive and 22 generalized place invariants in 19 ms returned sat
[2026-05-24 10:00:39] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-24 10:00:40] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 10:00:40] [INFO ] [Nat]Absence check using 63 positive place invariants in 20 ms returned sat
[2026-05-24 10:00:40] [INFO ] [Nat]Absence check using 63 positive and 22 generalized place invariants in 18 ms returned sat
[2026-05-24 10:00:40] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2026-05-24 10:00:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
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-24 10:00:45] [INFO ] [Real]Absence check using 63 positive place invariants in 27 ms returned sat
[2026-05-24 10:00:45] [INFO ] [Real]Absence check using 63 positive and 22 generalized place invariants in 18 ms returned sat
[2026-05-24 10:00:45] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2026-05-24 10:00:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 10:00:45] [INFO ] [Nat]Absence check using 63 positive place invariants in 21 ms returned sat
[2026-05-24 10:00:45] [INFO ] [Nat]Absence check using 63 positive and 22 generalized place invariants in 17 ms returned sat
[2026-05-24 10:00:45] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-24 10:00:50] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:308)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:874)
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-24 10:00:50] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2026-05-24 10:00:50] [INFO ] [Real]Absence check using 63 positive and 22 generalized place invariants in 34 ms returned sat
[2026-05-24 10:00:51] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2026-05-24 10:00:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 10:00:51] [INFO ] [Nat]Absence check using 63 positive place invariants in 22 ms returned sat
[2026-05-24 10:00:51] [INFO ] [Nat]Absence check using 63 positive and 22 generalized place invariants in 28 ms returned sat
[2026-05-24 10:00:51] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2026-05-24 10:00:53] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2317 ms
[2026-05-24 10:00:53] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 23 ms.
[2026-05-24 10:00:56] [INFO ] Added : 125 causal constraints over 25 iterations in 2402 ms. Result :unknown
[2026-05-24 10:00:56] [INFO ] [Real]Absence check using 63 positive place invariants in 19 ms returned sat
[2026-05-24 10:00:56] [INFO ] [Real]Absence check using 63 positive and 22 generalized place invariants in 19 ms returned sat
[2026-05-24 10:00:56] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2026-05-24 10:00:56] [INFO ] Solution in real domain found non-integer solution.
[2026-05-24 10:00:56] [INFO ] [Nat]Absence check using 63 positive place invariants in 21 ms returned sat
[2026-05-24 10:00:56] [INFO ] [Nat]Absence check using 63 positive and 22 generalized place invariants in 18 ms returned sat
[2026-05-24 10:00:57] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2026-05-24 10:00:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1931 ms
[2026-05-24 10:00:59] [INFO ] Computed and/alt/rep : 442/759/442 causal constraints (skipped 28 transitions) in 23 ms.
[2026-05-24 10:01:01] [INFO ] Added : 265 causal constraints over 53 iterations in 2788 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 286 edges and 518 vertex of which 7 / 518 are part of one of the 1 SCC in 7 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1063 edges and 512 vertex of which 510 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 510 transition count 355
Reduce places removed 107 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 218 place count 403 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 401 transition count 353
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 220 place count 401 transition count 275
Deduced a syphon composed of 78 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 169 rules applied. Total rules applied 389 place count 310 transition count 275
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 453 place count 246 transition count 211
Iterating global reduction 3 with 64 rules applied. Total rules applied 517 place count 246 transition count 211
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 517 place count 246 transition count 203
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 535 place count 236 transition count 203
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 155 rules applied. Total rules applied 690 place count 157 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 692 place count 156 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 694 place count 156 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 696 place count 154 transition count 128
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 697 place count 154 transition count 128
Applied a total of 697 rules in 125 ms. Remains 154 /518 variables (removed 364) and now considering 128/471 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 154/518 places, 128/471 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7811265533840437920.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4561360187013992445.kers'
[2026-05-24 10:01:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7811265533840437920.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4561360187013992445.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 128 rows 153 cols 735 entries
Finished phase 1 with 48 SingleSign rule and 40 generalized
[2026-05-24 10:01:02] [INFO ] Computed 66 invariants in 0 ms
Computed 66 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4561360187013992445.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (43253 resets) in 2259 ms. (442 steps per ms)
FORMULA BusinessProcesses-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (18174 resets) in 1355 ms. (737 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 37826 ms.

BK_STOP 1779616865880

--------------------
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="BusinessProcesses-PT-10"
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 BusinessProcesses-PT-10, 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 r034-tall-177946842000525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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