Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r265-tall-174931349700059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is MedleyB-PT-B06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-tall-174931349700059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.8K Jun 6 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 6 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 12:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 12:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 5.0K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 3.2M Jun 5 20:08 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-B06-UpperBounds-00
FORMULA_NAME MedleyB-PT-B06-UpperBounds-01
FORMULA_NAME MedleyB-PT-B06-UpperBounds-02
FORMULA_NAME MedleyB-PT-B06-UpperBounds-03
FORMULA_NAME MedleyB-PT-B06-UpperBounds-04
FORMULA_NAME MedleyB-PT-B06-UpperBounds-05
FORMULA_NAME MedleyB-PT-B06-UpperBounds-06
FORMULA_NAME MedleyB-PT-B06-UpperBounds-07
FORMULA_NAME MedleyB-PT-B06-UpperBounds-08
FORMULA_NAME MedleyB-PT-B06-UpperBounds-09
FORMULA_NAME MedleyB-PT-B06-UpperBounds-10
FORMULA_NAME MedleyB-PT-B06-UpperBounds-11
FORMULA_NAME MedleyB-PT-B06-UpperBounds-12
FORMULA_NAME MedleyB-PT-B06-UpperBounds-13
FORMULA_NAME MedleyB-PT-B06-UpperBounds-14
FORMULA_NAME MedleyB-PT-B06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749319030191

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-07 17:57:11] [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]
[2025-06-07 17:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 17:57:11] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2025-06-07 17:57:11] [INFO ] Transformed 964 places.
[2025-06-07 17:57:11] [INFO ] Transformed 5535 transitions.
[2025-06-07 17:57:11] [INFO ] Found NUPN structural information;
[2025-06-07 17:57:11] [INFO ] Parsed PT model containing 964 places and 5535 transitions and 65185 arcs in 448 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]
// Phase 1: matrix 5535 rows 964 cols
[2025-06-07 17:57:12] [INFO ] Computed 8 invariants in 135 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 (82 resets) in 85 ms. (116 steps per ms)
FORMULA MedleyB-PT-B06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (71 resets) in 105 ms. (566 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]
[2025-06-07 17:57:12] [INFO ] Invariant cache hit.
[2025-06-07 17:57:12] [INFO ] [Real]Absence check using 8 positive place invariants in 19 ms returned sat
[2025-06-07 17:57:13] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2025-06-07 17:57:16] [INFO ] Deduced a trap composed of 193 places in 1977 ms of which 46 ms to minimize.
[2025-06-07 17:57:16] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 29 ms returned sat
[2025-06-07 17:57:17] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2025-06-07 17:57:19] [INFO ] Deduced a trap composed of 193 places in 1776 ms of which 8 ms to minimize.
[2025-06-07 17:57:21] [INFO ] Deduced a trap composed of 196 places in 1655 ms of which 5 ms to minimize.
[2025-06-07 17:57:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-07 17:57:21] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-07 17:57:22] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2025-06-07 17:57:24] [INFO ] Deduced a trap composed of 193 places in 1687 ms of which 4 ms to minimize.
[2025-06-07 17:57:24] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 18 ms returned sat
[2025-06-07 17:57:26] [INFO ] [Nat]Absence check using state equation in 1306 ms returned sat
[2025-06-07 17:57:28] [INFO ] Deduced a trap composed of 193 places in 1649 ms of which 5 ms to minimize.
[2025-06-07 17:57:29] [INFO ] Deduced a trap composed of 192 places in 1665 ms of which 5 ms to minimize.
[2025-06-07 17:57:31] [INFO ] Deduced a trap composed of 118 places in 2012 ms of which 6 ms to minimize.
[2025-06-07 17:57:31] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-07 17:57:32] [INFO ] [Real]Absence check using 8 positive place invariants in 18 ms returned sat
[2025-06-07 17:57:33] [INFO ] [Real]Absence check using state equation in 1221 ms returned sat
[2025-06-07 17:57:35] [INFO ] Deduced a trap composed of 190 places in 1721 ms of which 5 ms to minimize.
[2025-06-07 17:57:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2025-06-07 17:57:36] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2025-06-07 17:57:38] [INFO ] Deduced a trap composed of 190 places in 1704 ms of which 5 ms to minimize.
[2025-06-07 17:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1967 ms
[2025-06-07 17:57:39] [INFO ] Computed and/alt/rep : 5278/31674/5278 causal constraints (skipped 256 transitions) in 803 ms.
Minimization took 855 ms.
[2025-06-07 17:57:40] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-07 17:57:41] [INFO ] [Real]Absence check using state equation in 1247 ms returned sat
[2025-06-07 17:57:43] [INFO ] Deduced a trap composed of 193 places in 1684 ms of which 5 ms to minimize.
[2025-06-07 17:57:43] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 19 ms returned sat
[2025-06-07 17:57:45] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2025-06-07 17:57:46] [INFO ] Deduced a trap composed of 193 places in 1671 ms of which 5 ms to minimize.
[2025-06-07 17:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1911 ms
[2025-06-07 17:57:47] [INFO ] Computed and/alt/rep : 5278/31674/5278 causal constraints (skipped 256 transitions) in 576 ms.
Minimization took 753 ms.
[2025-06-07 17:57:48] [INFO ] [Real]Absence check using 8 positive place invariants in 15 ms returned sat
[2025-06-07 17:57:49] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2025-06-07 17:57:51] [INFO ] Deduced a trap composed of 205 places in 1690 ms of which 4 ms to minimize.
[2025-06-07 17:57:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-06-07 17:57:53] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2025-06-07 17:57:54] [INFO ] Deduced a trap composed of 205 places in 1652 ms of which 4 ms to minimize.
[2025-06-07 17:57:56] [INFO ] Deduced a trap composed of 190 places in 1627 ms of which 4 ms to minimize.
[2025-06-07 17:57:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3622 ms
[2025-06-07 17:57:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:954)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2025-06-07 17:57:56] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-06-07 17:57:58] [INFO ] [Real]Absence check using state equation in 1219 ms returned sat
[2025-06-07 17:57:58] [INFO ] Computed and/alt/rep : 5278/31674/5278 causal constraints (skipped 256 transitions) in 416 ms.
[2025-06-07 17:57:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-07 17:57:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-06-07 17:58:00] [INFO ] [Nat]Absence check using state equation in 1213 ms returned sat
[2025-06-07 17:58:00] [INFO ] Computed and/alt/rep : 5278/31674/5278 causal constraints (skipped 256 transitions) in 408 ms.
Minimization took 764 ms.
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 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 5535/5535 transitions.
Graph (trivial) has 973 edges and 964 vertex of which 131 / 964 are part of one of the 20 SCC in 9 ms
Free SCC test removed 111 places
Drop transitions (Empty/Sink Transition effects.) removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Graph (complete) has 1949 edges and 853 vertex of which 839 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.36 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 616 transitions
Trivial Post-agglo rules discarded 616 transitions
Performed 616 trivial Post agglomeration. Transition count delta: 616
Iterating post reduction 0 with 623 rules applied. Total rules applied 625 place count 839 transition count 4761
Reduce places removed 616 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 652 rules applied. Total rules applied 1277 place count 223 transition count 4725
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 21 rules applied. Total rules applied 1298 place count 205 transition count 4722
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1301 place count 202 transition count 4722
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 17 Pre rules applied. Total rules applied 1301 place count 202 transition count 4705
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 1335 place count 185 transition count 4705
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 1389 place count 131 transition count 4651
Iterating global reduction 4 with 54 rules applied. Total rules applied 1443 place count 131 transition count 4651
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 1445 place count 131 transition count 4649
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1446 place count 130 transition count 4649
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1446 place count 130 transition count 4644
Deduced a syphon composed of 5 places in 7 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1456 place count 125 transition count 4644
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 1473 place count 108 transition count 636
Iterating global reduction 6 with 17 rules applied. Total rules applied 1490 place count 108 transition count 636
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 1503 place count 108 transition count 623
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1543 place count 88 transition count 603
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 1550 place count 81 transition count 596
Iterating global reduction 7 with 7 rules applied. Total rules applied 1557 place count 81 transition count 596
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1565 place count 77 transition count 604
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1566 place count 77 transition count 603
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1574 place count 77 transition count 595
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1576 place count 76 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1584 place count 76 transition count 593
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1586 place count 75 transition count 599
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1594 place count 75 transition count 591
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1596 place count 74 transition count 597
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1604 place count 74 transition count 589
Free-agglomeration rule applied 38 times.
Iterating global reduction 8 with 38 rules applied. Total rules applied 1642 place count 74 transition count 551
Reduce places removed 38 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 1697 place count 36 transition count 534
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1704 place count 29 transition count 527
Iterating global reduction 9 with 7 rules applied. Total rules applied 1711 place count 29 transition count 527
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 9 with 32 rules applied. Total rules applied 1743 place count 29 transition count 495
Drop transitions (Redundant composition of simpler transitions.) removed 95 transitions
Redundant transition composition rules discarded 95 transitions
Iterating global reduction 10 with 95 rules applied. Total rules applied 1838 place count 29 transition count 400
Applied a total of 1838 rules in 1133 ms. Remains 29 /964 variables (removed 935) and now considering 400/5535 (removed 5135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 29/964 places, 400/5535 transitions.
// Phase 1: matrix 400 rows 29 cols
[2025-06-07 17:58:02] [INFO ] Computed 8 invariants in 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 (2 resets) in 17496 ms. (57 steps per ms)
FORMULA MedleyB-PT-B06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyB-PT-B06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 473 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-07 17:58:20] [INFO ] Flatten gal took : 92 ms
[2025-06-07 17:58:21] [INFO ] Flatten gal took : 52 ms
[2025-06-07 17:58:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9660948831531302696.gal : 27 ms
[2025-06-07 17:58:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8463068977435145144.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9660948831531302696.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8463068977435145144.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 69824 ms.

BK_STOP 1749319101234

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-B06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is MedleyB-PT-B06, 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 r265-tall-174931349700059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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