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.r209-tall-174894546800112.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 ShieldPPPt-PT-030A, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r209-tall-174894546800112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 201K May 29 14:33 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 ShieldPPPt-PT-030A-UpperBounds-00
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-01
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-02
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-03
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-04
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-05
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-06
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-07
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-08
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-09
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-10
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-11
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-12
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-13
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-14
FORMULA_NAME ShieldPPPt-PT-030A-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749020654183

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-04 07:04:15] [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-04 07:04:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 07:04:15] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-04 07:04:15] [INFO ] Transformed 753 places.
[2025-06-04 07:04:15] [INFO ] Transformed 543 transitions.
[2025-06-04 07:04:15] [INFO ] Found NUPN structural information;
[2025-06-04 07:04:15] [INFO ] Parsed PT model containing 753 places and 543 transitions and 2166 arcs in 249 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
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 542 rows 753 cols
[2025-06-04 07:04:15] [INFO ] Computed 331 invariants in 19 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 (2 resets) in 109 ms. (90 steps per ms)
FORMULA ShieldPPPt-PT-030A-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (20 resets) in 408 ms. (244 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-04 07:04:16] [INFO ] Invariant cache hit.
[2025-06-04 07:04:16] [INFO ] [Real]Absence check using 331 positive place invariants in 63 ms returned sat
[2025-06-04 07:04:16] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2025-06-04 07:04:17] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 40 ms.
[2025-06-04 07:04:17] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:17] [INFO ] [Nat]Absence check using 331 positive place invariants in 56 ms returned sat
[2025-06-04 07:04:17] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2025-06-04 07:04:17] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 36 ms.
[2025-06-04 07:04:21] [INFO ] Added : 317 causal constraints over 64 iterations in 3352 ms. Result :sat
Minimization took 619 ms.
[2025-06-04 07:04:21] [INFO ] [Real]Absence check using 331 positive place invariants in 53 ms returned sat
[2025-06-04 07:04:22] [INFO ] [Real]Absence check using state equation in 185 ms returned sat
[2025-06-04 07:04:22] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 40 ms.
[2025-06-04 07:04:22] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:22] [INFO ] [Nat]Absence check using 331 positive place invariants in 55 ms returned sat
[2025-06-04 07:04:22] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-06-04 07:04:22] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-04 07:04:27] [INFO ] Added : 378 causal constraints over 78 iterations in 4500 ms. Result :sat
Minimization took 125 ms.
[2025-06-04 07:04:27] [INFO ] [Real]Absence check using 331 positive place invariants in 52 ms returned sat
[2025-06-04 07:04:27] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-06-04 07:04:27] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 35 ms.
[2025-06-04 07:04:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:28] [INFO ] [Nat]Absence check using 331 positive place invariants in 54 ms returned sat
[2025-06-04 07:04:28] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-06-04 07:04:28] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-04 07:04:32] [INFO ] Added : 398 causal constraints over 82 iterations in 4625 ms. Result :unknown
[2025-06-04 07:04:33] [INFO ] [Real]Absence check using 331 positive place invariants in 52 ms returned sat
[2025-06-04 07:04:33] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2025-06-04 07:04:33] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 35 ms.
[2025-06-04 07:04:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:33] [INFO ] [Nat]Absence check using 331 positive place invariants in 58 ms returned sat
[2025-06-04 07:04:33] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2025-06-04 07:04:34] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 31 ms.
[2025-06-04 07:04:38] [INFO ] Added : 390 causal constraints over 78 iterations in 4603 ms. Result :unknown
[2025-06-04 07:04:38] [INFO ] [Real]Absence check using 331 positive place invariants in 51 ms returned sat
[2025-06-04 07:04:38] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2025-06-04 07:04:38] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 30 ms.
[2025-06-04 07:04:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:39] [INFO ] [Nat]Absence check using 331 positive place invariants in 52 ms returned sat
[2025-06-04 07:04:39] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-06-04 07:04:39] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-04 07:04:44] [INFO ] Added : 389 causal constraints over 84 iterations in 4644 ms. Result :unknown
[2025-06-04 07:04:44] [INFO ] [Real]Absence check using 331 positive place invariants in 51 ms returned sat
[2025-06-04 07:04:44] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-04 07:04:44] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 34 ms.
[2025-06-04 07:04:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:44] [INFO ] [Nat]Absence check using 331 positive place invariants in 65 ms returned sat
[2025-06-04 07:04:45] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-06-04 07:04:45] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-04 07:04:49] [INFO ] Added : 400 causal constraints over 80 iterations in 4644 ms. Result :unknown
[2025-06-04 07:04:49] [INFO ] [Real]Absence check using 331 positive place invariants in 50 ms returned sat
[2025-06-04 07:04:50] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2025-06-04 07:04:50] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-04 07:04:50] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:50] [INFO ] [Nat]Absence check using 331 positive place invariants in 51 ms returned sat
[2025-06-04 07:04:50] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2025-06-04 07:04:50] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-04 07:04:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
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-04 07:04:55] [INFO ] [Real]Absence check using 331 positive place invariants in 55 ms returned sat
[2025-06-04 07:04:55] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-06-04 07:04:55] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 28 ms.
[2025-06-04 07:04:55] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:04:56] [INFO ] [Nat]Absence check using 331 positive place invariants in 50 ms returned sat
[2025-06-04 07:04:56] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2025-06-04 07:04:56] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 29 ms.
[2025-06-04 07:05:00] [INFO ] Added : 418 causal constraints over 86 iterations in 4620 ms. Result :unknown
[2025-06-04 07:05:01] [INFO ] [Real]Absence check using 331 positive place invariants in 50 ms returned sat
[2025-06-04 07:05:01] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2025-06-04 07:05:01] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 29 ms.
[2025-06-04 07:05:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:01] [INFO ] [Nat]Absence check using 331 positive place invariants in 51 ms returned sat
[2025-06-04 07:05:01] [INFO ] [Nat]Absence check using state equation in 178 ms returned sat
[2025-06-04 07:05:01] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 27 ms.
[2025-06-04 07:05:06] [INFO ] Added : 410 causal constraints over 82 iterations in 4648 ms. Result :unknown
[2025-06-04 07:05:06] [INFO ] [Real]Absence check using 331 positive place invariants in 52 ms returned sat
[2025-06-04 07:05:06] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2025-06-04 07:05:06] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 25 ms.
[2025-06-04 07:05:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-04 07:05:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 53 ms returned sat
[2025-06-04 07:05:07] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2025-06-04 07:05:07] [INFO ] Computed and/alt/rep : 541/1679/541 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-04 07:05:12] [INFO ] Added : 401 causal constraints over 82 iterations in 4546 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA ShieldPPPt-PT-030A-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ShieldPPPt-PT-030A-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 753 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p220) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 540/540 transitions.
Graph (complete) has 1826 edges and 753 vertex of which 750 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 748 transition count 537
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 746 transition count 535
Partial Free-agglomeration rule applied 120 times.
Drop transitions (Partial Free agglomeration) removed 120 transitions
Iterating global reduction 1 with 120 rules applied. Total rules applied 127 place count 746 transition count 535
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 745 transition count 534
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 129 place count 744 transition count 534
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 129 place count 744 transition count 532
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 742 transition count 532
Applied a total of 133 rules in 297 ms. Remains 742 /753 variables (removed 11) and now considering 532/540 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 742/753 places, 532/540 transitions.
// Phase 1: matrix 532 rows 742 cols
[2025-06-04 07:05:13] [INFO ] Computed 328 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ShieldPPPt-PT-030A-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 6486 ms. (154 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-04 07:05:20] [INFO ] Flatten gal took : 88 ms
[2025-06-04 07:05:20] [INFO ] Flatten gal took : 37 ms
[2025-06-04 07:05:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4044200040100361328.gal : 20 ms
[2025-06-04 07:05:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4175039318051669222.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4044200040100361328.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4175039318051669222.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 65143 ms.

BK_STOP 1749020720647

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="ShieldPPPt-PT-030A"
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 ShieldPPPt-PT-030A, 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 r209-tall-174894546800112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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