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-177969020100293.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-B02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969020100293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 796K
-rw-r--r-- 1 mcc users 7.7K Mar 7 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Mar 7 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 15 11:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 11:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 11:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 11:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Mar 7 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Mar 7 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 7 18:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Mar 7 18:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 11:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 11:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 359K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779705206413

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-B02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 10:33:27] [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:33:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 10:33:27] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2026-05-25 10:33:27] [INFO ] Transformed 1227 places.
[2026-05-25 10:33:27] [INFO ] Transformed 1472 transitions.
[2026-05-25 10:33:27] [INFO ] Found NUPN structural information;
[2026-05-25 10:33:27] [INFO ] Parsed PT model containing 1227 places and 1472 transitions and 4160 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 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-6425609323817095817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18315731492496952453.kers'
[2026-05-25 10:33:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6425609323817095817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18315731492496952453.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1472 rows 1227 cols 4160 entries
Finished phase 1 with 1222 SingleSign rule and 0 generalized
[2026-05-25 10:33:27] [INFO ] Computed 5 invariants in 5 ms
Computed 5 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18315731492496952453.kers
Total runtime 7 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 (130 resets) in 49 ms. (200 steps per ms)
FORMULA MedleyB-PT-B02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80005 steps (215 resets) in 83 ms. (952 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2026-05-25 10:33:28] [INFO ] Invariant cache hit.
[2026-05-25 10:33:28] [INFO ] [Real]Absence check using 5 positive place invariants in 39 ms returned sat
[2026-05-25 10:33:28] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2026-05-25 10:33:29] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 80 ms.
[2026-05-25 10:33:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:33:29] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2026-05-25 10:33:30] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2026-05-25 10:33:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1001 ms
[2026-05-25 10:33:31] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 66 ms.
[2026-05-25 10:33:34] [INFO ] Added : 230 causal constraints over 46 iterations in 3286 ms. Result :unknown
[2026-05-25 10:33:34] [INFO ] [Real]Absence check using 5 positive place invariants in 19 ms returned sat
[2026-05-25 10:33:35] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2026-05-25 10:33:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:33:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 21 ms returned sat
[2026-05-25 10:33:36] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2026-05-25 10:33:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1352 ms
[2026-05-25 10:33:38] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 75 ms.
[2026-05-25 10:33:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:33:41] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2026-05-25 10:33:41] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2026-05-25 10:33:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:33:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2026-05-25 10:33:43] [INFO ] [Nat]Absence check using state equation in 377 ms returned sat
[2026-05-25 10:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 797 ms
[2026-05-25 10:33:43] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 75 ms.
[2026-05-25 10:33:47] [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.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:33:47] [INFO ] [Real]Absence check using 5 positive place invariants in 17 ms returned sat
[2026-05-25 10:33:48] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2026-05-25 10:33:48] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 54 ms.
[2026-05-25 10:33:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:33:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 33 ms returned sat
[2026-05-25 10:33:49] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2026-05-25 10:33:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 879 ms
[2026-05-25 10:33:50] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 81 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2026-05-25 10:33:53] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2026-05-25 10:33:54] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2026-05-25 10:33:54] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 82 ms.
[2026-05-25 10:33:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:33:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-25 10:33:55] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2026-05-25 10:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 893 ms
[2026-05-25 10:33:56] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 86 ms.
[2026-05-25 10:33:59] [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 4
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:33:59] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2026-05-25 10:34:00] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2026-05-25 10:34:00] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 56 ms.
[2026-05-25 10:34:00] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:34:00] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2026-05-25 10:34:01] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2026-05-25 10:34:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1978 ms
[2026-05-25 10:34:03] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 65 ms.
[2026-05-25 10:34:05] [INFO ] Added : 180 causal constraints over 36 iterations in 2397 ms. Result :unknown
[2026-05-25 10:34:06] [INFO ] [Real]Absence check using 5 positive place invariants in 23 ms returned sat
[2026-05-25 10:34:06] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2026-05-25 10:34:07] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:34:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 19 ms returned sat
[2026-05-25 10:34:07] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2026-05-25 10:34:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1589 ms
[2026-05-25 10:34:09] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 76 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2026-05-25 10:34:12] [INFO ] [Real]Absence check using 5 positive place invariants in 34 ms returned sat
[2026-05-25 10:34:13] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2026-05-25 10:34:13] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 10:34:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 20 ms returned sat
[2026-05-25 10:34:14] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2026-05-25 10:34:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 774 ms
[2026-05-25 10:34:15] [INFO ] Computed and/alt/rep : 1395/2264/1395 causal constraints (skipped 76 transitions) in 57 ms.
Maximisation of solution failed !
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA MedleyB-PT-B02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyB-PT-B02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MedleyB-PT-B02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1227/1227 places, 1472/1472 transitions.
Graph (trivial) has 1208 edges and 1227 vertex of which 76 / 1227 are part of one of the 12 SCC in 11 ms
Free SCC test removed 64 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Graph (complete) has 1651 edges and 1163 vertex of which 1155 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 918 transitions
Trivial Post-agglo rules discarded 918 transitions
Performed 918 trivial Post agglomeration. Transition count delta: 918
Iterating post reduction 0 with 922 rules applied. Total rules applied 924 place count 1155 transition count 464
Reduce places removed 918 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 946 rules applied. Total rules applied 1870 place count 237 transition count 436
Reduce places removed 10 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 14 rules applied. Total rules applied 1884 place count 227 transition count 432
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1888 place count 223 transition count 432
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 1888 place count 223 transition count 389
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1974 place count 180 transition count 389
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2022 place count 132 transition count 341
Iterating global reduction 4 with 48 rules applied. Total rules applied 2070 place count 132 transition count 341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2070 place count 132 transition count 340
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 2072 place count 131 transition count 340
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 2098 place count 105 transition count 185
Iterating global reduction 4 with 26 rules applied. Total rules applied 2124 place count 105 transition count 185
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2136 place count 105 transition count 173
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 2143 place count 98 transition count 166
Iterating global reduction 5 with 7 rules applied. Total rules applied 2150 place count 98 transition count 166
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 2156 place count 92 transition count 160
Iterating global reduction 5 with 6 rules applied. Total rules applied 2162 place count 92 transition count 160
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 2168 place count 92 transition count 154
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 2196 place count 78 transition count 140
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 2197 place count 78 transition count 139
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2201 place count 74 transition count 135
Iterating global reduction 7 with 4 rules applied. Total rules applied 2205 place count 74 transition count 135
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2209 place count 70 transition count 131
Iterating global reduction 7 with 4 rules applied. Total rules applied 2213 place count 70 transition count 131
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2217 place count 66 transition count 127
Iterating global reduction 7 with 4 rules applied. Total rules applied 2221 place count 66 transition count 127
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 2231 place count 61 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2232 place count 61 transition count 154
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 2234 place count 61 transition count 152
Free-agglomeration rule applied 22 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 2256 place count 61 transition count 123
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 2284 place count 39 transition count 117
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 2288 place count 35 transition count 113
Iterating global reduction 9 with 4 rules applied. Total rules applied 2292 place count 35 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2293 place count 35 transition count 112
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 2317 place count 35 transition count 88
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 10 with 2 rules applied. Total rules applied 2319 place count 34 transition count 91
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 2322 place count 34 transition count 91
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 2323 place count 34 transition count 90
Applied a total of 2323 rules in 135 ms. Remains 34 /1227 variables (removed 1193) and now considering 90/1472 (removed 1382) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 34/1227 places, 90/1472 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-473271669519034455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11889188505799088404.kers'
[2026-05-25 10:34:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-473271669519034455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11889188505799088404.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 90 rows 33 cols 356 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 10:34:19] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11889188505799088404.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (2 resets) in 1288 ms. (775 steps per ms)
FORMULA MedleyB-PT-B02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 290 ms. (3436 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 53275 ms.

BK_STOP 1779705260824

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

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B02.tgz
mv MedleyB-PT-B02 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;