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.r097-smll-174860111800054.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 FlexibleBarrier-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r097-smll-174860111800054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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.0K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 141K 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 FlexibleBarrier-PT-06b-UpperBounds-00
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-01
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-02
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-03
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-04
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-05
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-06
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-07
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-08
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-09
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-10
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-11
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-12
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-13
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-14
FORMULA_NAME FlexibleBarrier-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748678906119

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 08:08:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 08:08:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 08:08:28] [INFO ] Load time of PNML (sax parser for PT used): 200 ms
[2025-05-31 08:08:28] [INFO ] Transformed 542 places.
[2025-05-31 08:08:28] [INFO ] Transformed 621 transitions.
[2025-05-31 08:08:28] [INFO ] Found NUPN structural information;
[2025-05-31 08:08:28] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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 621 rows 542 cols
[2025-05-31 08:08:29] [INFO ] Computed 8 invariants in 37 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 (190 resets) in 81 ms. (121 steps per ms)
FORMULA FlexibleBarrier-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (196 resets) in 99 ms. (700 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2025-05-31 08:08:29] [INFO ] Invariant cache hit.
[2025-05-31 08:08:30] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2025-05-31 08:08:30] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2025-05-31 08:08:30] [INFO ] Deduced a trap composed of 188 places in 378 ms of which 25 ms to minimize.
[2025-05-31 08:08:31] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2025-05-31 08:08:31] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2025-05-31 08:08:32] [INFO ] Deduced a trap composed of 188 places in 293 ms of which 7 ms to minimize.
[2025-05-31 08:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 413 ms
[2025-05-31 08:08:32] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 99 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2025-05-31 08:08:36] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-31 08:08:36] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2025-05-31 08:08:36] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 74 ms.
[2025-05-31 08:08:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2025-05-31 08:08:37] [INFO ] [Nat]Absence check using state equation in 466 ms returned sat
[2025-05-31 08:08:37] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 100 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:08:42] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-31 08:08:42] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2025-05-31 08:08:43] [INFO ] Deduced a trap composed of 165 places in 283 ms of which 6 ms to minimize.
[2025-05-31 08:08:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2025-05-31 08:08:43] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2025-05-31 08:08:44] [INFO ] Deduced a trap composed of 165 places in 242 ms of which 7 ms to minimize.
[2025-05-31 08:08:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 333 ms
[2025-05-31 08:08:44] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 83 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:08:48] [INFO ] [Real]Absence check using 8 positive place invariants in 22 ms returned sat
[2025-05-31 08:08:48] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2025-05-31 08:08:49] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 73 ms.
[2025-05-31 08:08:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-31 08:08:49] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2025-05-31 08:08:49] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 81 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:08:54] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-31 08:08:54] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2025-05-31 08:08:55] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 6 ms to minimize.
[2025-05-31 08:08:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:08:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2025-05-31 08:08:55] [INFO ] [Nat]Absence check using state equation in 407 ms returned sat
[2025-05-31 08:08:56] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 5 ms to minimize.
[2025-05-31 08:08:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 336 ms
[2025-05-31 08:08:56] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 70 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2025-05-31 08:09:00] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-31 08:09:00] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2025-05-31 08:09:01] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 73 ms.
[2025-05-31 08:09:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:09:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 25 ms returned sat
[2025-05-31 08:09:01] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2025-05-31 08:09:01] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 72 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2025-05-31 08:09:06] [INFO ] [Real]Absence check using 8 positive place invariants in 23 ms returned sat
[2025-05-31 08:09:06] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2025-05-31 08:09:07] [INFO ] Deduced a trap composed of 163 places in 295 ms of which 5 ms to minimize.
[2025-05-31 08:09:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 08:09:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 24 ms returned sat
[2025-05-31 08:09:07] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2025-05-31 08:09:08] [INFO ] Deduced a trap composed of 163 places in 309 ms of which 6 ms to minimize.
[2025-05-31 08:09:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2025-05-31 08:09:08] [INFO ] Computed and/alt/rep : 576/1069/576 causal constraints (skipped 44 transitions) in 66 ms.
[2025-05-31 08:09:12] [INFO ] Added : 310 causal constraints over 62 iterations in 3987 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0, 1, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 542 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 542/542 places, 621/621 transitions.
Graph (trivial) has 513 edges and 542 vertex of which 38 / 542 are part of one of the 6 SCC in 11 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 510 transition count 438
Reduce places removed 144 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 145 rules applied. Total rules applied 290 place count 366 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 365 transition count 437
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 291 place count 365 transition count 412
Deduced a syphon composed of 25 places in 4 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 341 place count 340 transition count 412
Discarding 163 places :
Symmetric choice reduction at 3 with 163 rule applications. Total rules 504 place count 177 transition count 249
Iterating global reduction 3 with 163 rules applied. Total rules applied 667 place count 177 transition count 249
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 667 place count 177 transition count 242
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 681 place count 170 transition count 242
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 686 place count 170 transition count 237
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 710 place count 146 transition count 213
Iterating global reduction 4 with 24 rules applied. Total rules applied 734 place count 146 transition count 213
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 754 place count 146 transition count 193
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 816 place count 115 transition count 162
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 822 place count 115 transition count 156
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 828 place count 109 transition count 150
Iterating global reduction 6 with 6 rules applied. Total rules applied 834 place count 109 transition count 150
Free-agglomeration rule applied 67 times.
Iterating global reduction 6 with 67 rules applied. Total rules applied 901 place count 109 transition count 83
Reduce places removed 67 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 6 with 92 rules applied. Total rules applied 993 place count 42 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 994 place count 42 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 995 place count 41 transition count 57
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 30 edges and 40 vertex of which 12 / 40 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
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 7 with 3 rules applied. Total rules applied 998 place count 34 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 1011 place count 33 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 5 Pre rules applied. Total rules applied 1011 place count 33 transition count 39
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 1021 place count 28 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 1026 place count 28 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1036 place count 23 transition count 29
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1041 place count 23 transition count 24
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 14 rules applied. Total rules applied 1055 place count 14 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 11 with 1 rules applied. Total rules applied 1056 place count 14 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1058 place count 13 transition count 17
Applied a total of 1058 rules in 282 ms. Remains 13 /542 variables (removed 529) and now considering 17/621 (removed 604) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 13/542 places, 17/621 transitions.
// Phase 1: matrix 17 rows 13 cols
[2025-05-31 08:09:13] [INFO ] Computed 3 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0, 1, 1, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 805 ms. (1240 steps per ms)
FORMULA FlexibleBarrier-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2 resets) in 318 ms. (3134 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-05-31 08:09:14] [INFO ] Flatten gal took : 35 ms
[2025-05-31 08:09:14] [INFO ] Flatten gal took : 6 ms
[2025-05-31 08:09:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6613639991990623473.gal : 7 ms
[2025-05-31 08:09:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12665877548303533523.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/ReachabilityCardinality6613639991990623473.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12665877548303533523.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 46352 ms.

BK_STOP 1748678954957

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r097-smll-174860111800054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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