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.r084-tall-174860080100198.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 DLCshifumi-PT-3b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080100198
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 2.3M 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 booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748734424799

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DLCshifumi-PT-3b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 23:33:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-31 23:33:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 23:33:46] [INFO ] Load time of PNML (sax parser for PT used): 334 ms
[2025-05-31 23:33:46] [INFO ] Transformed 7058 places.
[2025-05-31 23:33:46] [INFO ] Transformed 9611 transitions.
[2025-05-31 23:33:46] [INFO ] Found NUPN structural information;
[2025-05-31 23:33:46] [INFO ] Parsed PT model containing 7058 places and 9611 transitions and 24573 arcs in 714 ms.
Graph (trivial) has 6795 edges and 7058 vertex of which 792 / 7058 are part of one of the 51 SCC in 23 ms
Free SCC test removed 741 places
Structural test allowed to assert that 3257 places are NOT stable. Took 80 ms.
Ensure Unique test removed 786 transitions
Reduce redundant transitions removed 786 transitions.
RANDOM walk for 40000 steps (8 resets) in 7892 ms. (5 steps per ms) remains 796/3801 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 28 ms. (4 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 46 ms. (2 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 29 ms. (4 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 48 ms. (2 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 23 ms. (5 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 45 ms. (2 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 11 ms. (10 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 7 ms. (15 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 5 ms. (20 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 6 ms. (17 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 796/796 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 8 ms. (13 steps per ms) remains 796/796 properties
BEST_FIRST walk for 121 steps (8 resets) in 9 ms. (12 steps per ms) remains 796/796 properties
[2025-05-31 23:33:49] [INFO ] Flow matrix only has 8775 transitions (discarded 50 similar events)
// Phase 1: matrix 8775 rows 6317 cols
[2025-05-31 23:33:49] [INFO ] Computed 282 invariants in 56 ms
[2025-05-31 23:33:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 796/796 constraints. Problems are: Problem set: 0 solved, 796 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/15092 variables, and 796 constraints, problems are : Problem set: 0 solved, 796 unsolved in 5098 ms.
Refiners :[Domain max(s): 796/6317 constraints, Positive P Invariants (semi-flows): 0/282 constraints, State Equation: 0/6317 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 796/796 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 796 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/796 variables, 796/796 constraints. Problems are: Problem set: 0 solved, 796 unsolved
(s1012 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s64 1)
(s65 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s93 1)
(s94 1)
(s95 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s193 1)
(s194 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s203 1)
(s204 1)
(s205 1)
(s240 1)
(s241 1)
(s242 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s286 1)
(s287 1)
(s291 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s328 1)
(s329 1)
(s330 1)
(s367 1)
(s369 1)
(s370 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s457 1)
(s458 1)
(s462 1)
(s463 1)
(s467 1)
(s468 1)
(s469 1)
(s483 1)
(s484 1)
(s504 1)
(s505 1)
(s506 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s550 1)
(s551 1)
(s555 1)
(s556 1)
(s557 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s592 1)
(s593 1)
(s594 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s719 1)
(s721 1)
(s722 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s809 1)
(s810 1)
(s813 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s902 1)
(s903 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s1011 1)
(s1012 1timeout
)
(s1013 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/15092 variables, and 796 constraints, problems are : Problem set: 0 solved, 796 unsolved in 5023 ms.
Refiners :[Domain max(s): 796/6317 constraints, Positive P Invariants (semi-flows): 0/282 constraints, State Equation: 0/6317 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/796 constraints, Known Traps: 0/0 constraints]
After SMT, in 11161ms problems are : Problem set: 0 solved, 796 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 796 out of 6317 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6317/6317 places, 8825/8825 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2987 transitions
Trivial Post-agglo rules discarded 2987 transitions
Performed 2987 trivial Post agglomeration. Transition count delta: 2987
Iterating post reduction 0 with 3038 rules applied. Total rules applied 3038 place count 6317 transition count 5787
Reduce places removed 2987 places and 0 transitions.
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 1 with 3082 rules applied. Total rules applied 6120 place count 3330 transition count 5692
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 50 rules applied. Total rules applied 6170 place count 3284 transition count 5688
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 6172 place count 3282 transition count 5688
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 6172 place count 3282 transition count 5615
Deduced a syphon composed of 73 places in 34 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 6318 place count 3209 transition count 5615
Discarding 512 places :
Symmetric choice reduction at 4 with 512 rule applications. Total rules 6830 place count 2697 transition count 5103
Iterating global reduction 4 with 512 rules applied. Total rules applied 7342 place count 2697 transition count 5103
Performed 140 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 140 Pre rules applied. Total rules applied 7342 place count 2697 transition count 4963
Deduced a syphon composed of 140 places in 34 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 4 with 280 rules applied. Total rules applied 7622 place count 2557 transition count 4963
Discarding 95 places :
Symmetric choice reduction at 4 with 95 rule applications. Total rules 7717 place count 2462 transition count 3918
Iterating global reduction 4 with 95 rules applied. Total rules applied 7812 place count 2462 transition count 3918
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 4 with 81 rules applied. Total rules applied 7893 place count 2462 transition count 3837
Performed 497 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 497 places in 2 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 5 with 994 rules applied. Total rules applied 8887 place count 1965 transition count 3337
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 8890 place count 1965 transition count 3334
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition with reduction of 57 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 6 with 202 rules applied. Total rules applied 9092 place count 1864 transition count 3526
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 9110 place count 1846 transition count 3418
Iterating global reduction 6 with 18 rules applied. Total rules applied 9128 place count 1846 transition count 3418
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 6 with 54 rules applied. Total rules applied 9182 place count 1846 transition count 3364
Performed 13 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 9208 place count 1833 transition count 3393
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 9210 place count 1831 transition count 3381
Iterating global reduction 7 with 2 rules applied. Total rules applied 9212 place count 1831 transition count 3381
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 9218 place count 1831 transition count 3375
Drop transitions (Redundant composition of simpler transitions.) removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 8 with 66 rules applied. Total rules applied 9284 place count 1831 transition count 3309
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 9289 place count 1826 transition count 3304
Iterating global reduction 8 with 5 rules applied. Total rules applied 9294 place count 1826 transition count 3304
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 9299 place count 1821 transition count 3099
Iterating global reduction 8 with 5 rules applied. Total rules applied 9304 place count 1821 transition count 3099
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 9309 place count 1821 transition count 3094
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 9315 place count 1818 transition count 3091
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 9318 place count 1815 transition count 2968
Iterating global reduction 9 with 3 rules applied. Total rules applied 9321 place count 1815 transition count 2968
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 9324 place count 1815 transition count 2965
Free-agglomeration rule applied 613 times with reduction of 201 identical transitions.
Iterating global reduction 10 with 613 rules applied. Total rules applied 9937 place count 1815 transition count 2151
Reduce places removed 613 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 365 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 368 transitions.
Graph (complete) has 2465 edges and 1202 vertex of which 1198 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 982 rules applied. Total rules applied 10919 place count 1198 transition count 1783
Discarding 49 places :
Symmetric choice reduction at 11 with 49 rule applications. Total rules 10968 place count 1149 transition count 1696
Iterating global reduction 11 with 49 rules applied. Total rules applied 11017 place count 1149 transition count 1696
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 11 with 20 rules applied. Total rules applied 11037 place count 1149 transition count 1676
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 11039 place count 1149 transition count 1676
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 11040 place count 1149 transition count 1675
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 11043 place count 1149 transition count 1675
Applied a total of 11043 rules in 2266 ms. Remains 1149 /6317 variables (removed 5168) and now considering 1675/8825 (removed 7150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2276 ms. Remains : 1149/6317 places, 1675/8825 transitions.
RANDOM walk for 429065 steps (0 resets) in 10420 ms. (41 steps per ms) remains 0/796 properties
Able to resolve query StableMarking after proving 3803 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST TOPOLOGICAL
Total runtime 19864 ms.
ITS solved all properties within timeout

BK_STOP 1748734446143

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

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="DLCshifumi-PT-3b"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DLCshifumi-PT-3b, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080100198"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCshifumi-PT-3b.tgz
mv DLCshifumi-PT-3b execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;