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.r111-smll-174867015900084.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 HealthRecord-PT-17, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-smll-174867015900084
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 175K May 29 14:32 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 HealthRecord-PT-17-UpperBounds-00
FORMULA_NAME HealthRecord-PT-17-UpperBounds-01
FORMULA_NAME HealthRecord-PT-17-UpperBounds-02
FORMULA_NAME HealthRecord-PT-17-UpperBounds-03
FORMULA_NAME HealthRecord-PT-17-UpperBounds-04
FORMULA_NAME HealthRecord-PT-17-UpperBounds-05
FORMULA_NAME HealthRecord-PT-17-UpperBounds-06
FORMULA_NAME HealthRecord-PT-17-UpperBounds-07
FORMULA_NAME HealthRecord-PT-17-UpperBounds-08
FORMULA_NAME HealthRecord-PT-17-UpperBounds-09
FORMULA_NAME HealthRecord-PT-17-UpperBounds-10
FORMULA_NAME HealthRecord-PT-17-UpperBounds-11
FORMULA_NAME HealthRecord-PT-17-UpperBounds-12
FORMULA_NAME HealthRecord-PT-17-UpperBounds-13
FORMULA_NAME HealthRecord-PT-17-UpperBounds-14
FORMULA_NAME HealthRecord-PT-17-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748785890740

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 13:51:33] [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-01 13:51:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 13:51:33] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2025-06-01 13:51:33] [INFO ] Transformed 624 places.
[2025-06-01 13:51:33] [INFO ] Transformed 828 transitions.
[2025-06-01 13:51:33] [INFO ] Found NUPN structural information;
[2025-06-01 13:51:33] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 487 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 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 828 rows 624 cols
[2025-06-01 13:51:33] [INFO ] Computed 18 invariants in 60 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 (85 resets) in 85 ms. (116 steps per ms)
FORMULA HealthRecord-PT-17-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90008 steps (122 resets) in 130 ms. (687 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-01 13:51:34] [INFO ] Invariant cache hit.
[2025-06-01 13:51:35] [INFO ] [Real]Absence check using 10 positive place invariants in 49 ms returned sat
[2025-06-01 13:51:35] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 24 ms returned sat
[2025-06-01 13:51:35] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2025-06-01 13:51:36] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 136 ms.
[2025-06-01 13:51:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 66 ms returned sat
[2025-06-01 13:51:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 37 ms returned sat
[2025-06-01 13:51:37] [INFO ] [Nat]Absence check using state equation in 502 ms returned sat
[2025-06-01 13:51:37] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 71 ms.
[2025-06-01 13:51:39] [INFO ] Added : 86 causal constraints over 18 iterations in 1489 ms. Result :sat
Minimization took 592 ms.
[2025-06-01 13:51:40] [INFO ] [Real]Absence check using 10 positive place invariants in 39 ms returned sat
[2025-06-01 13:51:40] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2025-06-01 13:51:40] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2025-06-01 13:51:41] [INFO ] Deduced a trap composed of 146 places in 466 ms of which 78 ms to minimize.
[2025-06-01 13:51:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 40 ms returned sat
[2025-06-01 13:51:41] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2025-06-01 13:51:42] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2025-06-01 13:51:42] [INFO ] Deduced a trap composed of 146 places in 425 ms of which 9 ms to minimize.
[2025-06-01 13:51:43] [INFO ] Deduced a trap composed of 136 places in 441 ms of which 7 ms to minimize.
[2025-06-01 13:51:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1046 ms
[2025-06-01 13:51:43] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 116 ms.
Maximisation of solution failed !
Minimization took 10 ms.
[2025-06-01 13:51:46] [INFO ] [Real]Absence check using 10 positive place invariants in 38 ms returned sat
[2025-06-01 13:51:46] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 22 ms returned sat
[2025-06-01 13:51:47] [INFO ] [Real]Absence check using state equation in 550 ms returned sat
[2025-06-01 13:51:47] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 108 ms.
[2025-06-01 13:51:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 36 ms returned sat
[2025-06-01 13:51:48] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 18 ms returned sat
[2025-06-01 13:51:49] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2025-06-01 13:51:49] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 108 ms.
[2025-06-01 13:51:50] [INFO ] Added : 88 causal constraints over 18 iterations in 1452 ms. Result :sat
Minimization took 575 ms.
[2025-06-01 13:51:51] [INFO ] [Real]Absence check using 10 positive place invariants in 35 ms returned sat
[2025-06-01 13:51:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 25 ms returned sat
[2025-06-01 13:51:52] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2025-06-01 13:51:52] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 100 ms.
[2025-06-01 13:51:52] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 37 ms returned sat
[2025-06-01 13:51:53] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2025-06-01 13:51:53] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2025-06-01 13:51:53] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 87 ms.
[2025-06-01 13:51:55] [INFO ] Added : 80 causal constraints over 16 iterations in 1298 ms. Result :sat
Minimization took 567 ms.
[2025-06-01 13:51:55] [INFO ] [Real]Absence check using 10 positive place invariants in 34 ms returned sat
[2025-06-01 13:51:55] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2025-06-01 13:51:56] [INFO ] [Real]Absence check using state equation in 503 ms returned sat
[2025-06-01 13:51:56] [INFO ] Deduced a trap composed of 147 places in 370 ms of which 6 ms to minimize.
[2025-06-01 13:51:56] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:51:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 24 ms returned sat
[2025-06-01 13:51:57] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2025-06-01 13:51:57] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2025-06-01 13:51:57] [INFO ] Deduced a trap composed of 147 places in 307 ms of which 7 ms to minimize.
[2025-06-01 13:51:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 374 ms
[2025-06-01 13:51:57] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 58 ms.
[2025-06-01 13:51:59] [INFO ] Added : 122 causal constraints over 25 iterations in 1870 ms. Result :sat
Minimization took 574 ms.
[2025-06-01 13:52:00] [INFO ] [Real]Absence check using 10 positive place invariants in 35 ms returned sat
[2025-06-01 13:52:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 20 ms returned sat
[2025-06-01 13:52:01] [INFO ] [Real]Absence check using state equation in 500 ms returned sat
[2025-06-01 13:52:01] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 96 ms.
[2025-06-01 13:52:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:52:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 25 ms returned sat
[2025-06-01 13:52:01] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 12 ms returned sat
[2025-06-01 13:52:02] [INFO ] [Nat]Absence check using state equation in 333 ms returned sat
[2025-06-01 13:52:02] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 74 ms.
[2025-06-01 13:52:05] [INFO ] Added : 248 causal constraints over 51 iterations in 3042 ms. Result :sat
Minimization took 578 ms.
[2025-06-01 13:52:06] [INFO ] [Real]Absence check using 10 positive place invariants in 33 ms returned sat
[2025-06-01 13:52:06] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2025-06-01 13:52:06] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2025-06-01 13:52:06] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 93 ms.
[2025-06-01 13:52:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:52:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 36 ms returned sat
[2025-06-01 13:52:07] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 39 ms returned sat
[2025-06-01 13:52:08] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2025-06-01 13:52:08] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 91 ms.
[2025-06-01 13:52:12] [INFO ] Deduced a trap composed of 138 places in 212 ms of which 5 ms to minimize.
[2025-06-01 13:52:12] [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.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
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-01 13:52:12] [INFO ] [Real]Absence check using 10 positive place invariants in 36 ms returned sat
[2025-06-01 13:52:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 21 ms returned sat
[2025-06-01 13:52:13] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2025-06-01 13:52:13] [INFO ] Deduced a trap composed of 95 places in 449 ms of which 7 ms to minimize.
[2025-06-01 13:52:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:52:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 33 ms returned sat
[2025-06-01 13:52:14] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2025-06-01 13:52:14] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2025-06-01 13:52:15] [INFO ] Deduced a trap composed of 95 places in 461 ms of which 8 ms to minimize.
[2025-06-01 13:52:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2025-06-01 13:52:15] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 92 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-06-01 13:52:19] [INFO ] [Real]Absence check using 10 positive place invariants in 23 ms returned sat
[2025-06-01 13:52:19] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 19 ms returned sat
[2025-06-01 13:52:19] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2025-06-01 13:52:19] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 92 ms.
[2025-06-01 13:52:20] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 13:52:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 52 ms returned sat
[2025-06-01 13:52:20] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 24 ms returned sat
[2025-06-01 13:52:21] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2025-06-01 13:52:21] [INFO ] Computed and/alt/rep : 757/919/757 causal constraints (skipped 70 transitions) in 64 ms.
[2025-06-01 13:52:23] [INFO ] Added : 107 causal constraints over 22 iterations in 1619 ms. Result :sat
Minimization took 589 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 9 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 730 edges and 624 vertex of which 87 / 624 are part of one of the 21 SCC in 8 ms
Free SCC test removed 66 places
Drop transitions (Empty/Sink Transition effects.) removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Graph (complete) has 1200 edges and 558 vertex of which 511 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.3 ms
Discarding 47 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Drop transitions (Empty/Sink Transition effects.) removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 406 rules applied. Total rules applied 408 place count 511 transition count 296
Reduce places removed 280 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 320 rules applied. Total rules applied 728 place count 231 transition count 256
Reduce places removed 16 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 23 rules applied. Total rules applied 751 place count 215 transition count 249
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 759 place count 208 transition count 248
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 759 place count 208 transition count 234
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 787 place count 194 transition count 234
Discarding 80 places :
Symmetric choice reduction at 4 with 80 rule applications. Total rules 867 place count 114 transition count 154
Iterating global reduction 4 with 80 rules applied. Total rules applied 947 place count 114 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 948 place count 114 transition count 153
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 948 place count 114 transition count 148
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 958 place count 109 transition count 148
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 968 place count 99 transition count 138
Iterating global reduction 5 with 10 rules applied. Total rules applied 978 place count 99 transition count 138
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 990 place count 87 transition count 126
Iterating global reduction 5 with 12 rules applied. Total rules applied 1002 place count 87 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1011 place count 87 transition count 117
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 1016 place count 82 transition count 110
Iterating global reduction 6 with 5 rules applied. Total rules applied 1021 place count 82 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1024 place count 82 transition count 107
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1026 place count 80 transition count 105
Iterating global reduction 7 with 2 rules applied. Total rules applied 1028 place count 80 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1034 place count 80 transition count 99
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 8 with 40 rules applied. Total rules applied 1074 place count 60 transition count 79
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1080 place count 57 transition count 104
Free-agglomeration rule applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 1095 place count 57 transition count 89
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 1110 place count 42 transition count 89
Applied a total of 1110 rules in 156 ms. Remains 42 /624 variables (removed 582) and now considering 89/828 (removed 739) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 42/624 places, 89/828 transitions.
[2025-06-01 13:52:23] [INFO ] Flow matrix only has 74 transitions (discarded 15 similar events)
// Phase 1: matrix 74 rows 42 cols
[2025-06-01 13:52:23] [INFO ] Computed 8 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (110898 resets) in 2059 ms. (485 steps per ms)
FORMULA HealthRecord-PT-17-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HealthRecord-PT-17-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (14940 resets) in 531 ms. (1879 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-01 13:52:26] [INFO ] Flatten gal took : 91 ms
[2025-06-01 13:52:26] [INFO ] Flatten gal took : 26 ms
[2025-06-01 13:52:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1637169046930209319.gal : 16 ms
[2025-06-01 13:52:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8499967652311625538.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/ReachabilityCardinality1637169046930209319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8499967652311625538.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 53860 ms.

BK_STOP 1748785946988

--------------------
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="HealthRecord-PT-17"
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 HealthRecord-PT-17, 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 r111-smll-174867015900084"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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