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.r014-tall-174853744100463.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 AutonomousCar-PT-09b, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853744100463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K 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 865K 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 1748550360133

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 20:26:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-29 20:26:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 20:26:01] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2025-05-29 20:26:01] [INFO ] Transformed 391 places.
[2025-05-29 20:26:01] [INFO ] Transformed 1554 transitions.
[2025-05-29 20:26:01] [INFO ] Found NUPN structural information;
[2025-05-29 20:26:01] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 288 ms.
Graph (trivial) has 376 edges and 391 vertex of which 4 / 391 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Structural test allowed to assert that 85 places are NOT stable. Took 29 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (322 resets) in 2492 ms. (16 steps per ms) remains 19/306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
[2025-05-29 20:26:02] [INFO ] Flow matrix only has 1551 transitions (discarded 1 similar events)
// Phase 1: matrix 1551 rows 389 cols
[2025-05-29 20:26:02] [INFO ] Computed 14 invariants in 45 ms
[2025-05-29 20:26:02] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 181/200 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 181/206 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 189/389 variables, 8/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 189/403 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1550/1939 variables, 389/792 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1939 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 1/1940 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1940 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 0/1940 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1940/1940 variables, and 793 constraints, problems are : Problem set: 0 solved, 19 unsolved in 2011 ms.
Refiners :[Domain max(s): 389/389 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 389/389 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 181/200 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 181/206 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 20:26:05] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 18 ms to minimize.
[2025-05-29 20:26:05] [INFO ] Deduced a trap composed of 38 places in 224 ms of which 1 ms to minimize.
[2025-05-29 20:26:05] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 1 ms to minimize.
[2025-05-29 20:26:05] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2025-05-29 20:26:06] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 2 ms to minimize.
[2025-05-29 20:26:06] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 189/389 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 189/409 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 20:26:07] [INFO ] Deduced a trap composed of 35 places in 442 ms of which 2 ms to minimize.
[2025-05-29 20:26:08] [INFO ] Deduced a trap composed of 15 places in 544 ms of which 4 ms to minimize.
[2025-05-29 20:26:08] [INFO ] Deduced a trap composed of 24 places in 465 ms of which 2 ms to minimize.
[2025-05-29 20:26:08] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-29 20:26:09] [INFO ] Deduced a trap composed of 12 places in 515 ms of which 2 ms to minimize.
[2025-05-29 20:26:09] [INFO ] Deduced a trap composed of 24 places in 460 ms of which 3 ms to minimize.
SMT process timed out in 7296ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 389 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 389/389 places, 1552/1552 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 168 rules applied. Total rules applied 168 place count 389 transition count 1384
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 1 with 215 rules applied. Total rules applied 383 place count 223 transition count 1335
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 411 place count 195 transition count 1335
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 411 place count 195 transition count 1329
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 423 place count 189 transition count 1329
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 453 place count 159 transition count 1299
Iterating global reduction 3 with 30 rules applied. Total rules applied 483 place count 159 transition count 1299
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 3 with 324 rules applied. Total rules applied 807 place count 159 transition count 975
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 807 place count 159 transition count 973
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 811 place count 157 transition count 973
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 818 place count 150 transition count 918
Iterating global reduction 4 with 7 rules applied. Total rules applied 825 place count 150 transition count 918
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 837 place count 150 transition count 906
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 843 place count 144 transition count 906
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 933 place count 99 transition count 861
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 941 place count 91 transition count 781
Iterating global reduction 6 with 8 rules applied. Total rules applied 949 place count 91 transition count 781
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 950 place count 91 transition count 780
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 964 place count 91 transition count 766
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 978 place count 77 transition count 766
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 981 place count 77 transition count 766
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 982 place count 76 transition count 765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 983 place count 75 transition count 765
Applied a total of 983 rules in 468 ms. Remains 75 /389 variables (removed 314) and now considering 765/1552 (removed 787) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 488 ms. Remains : 75/389 places, 765/1552 transitions.
RANDOM walk for 4000000 steps (22010 resets) in 35853 ms. (111 steps per ms) remains 1/19 properties
BEST_FIRST walk for 4000004 steps (2914 resets) in 5561 ms. (719 steps per ms) remains 1/1 properties
// Phase 1: matrix 765 rows 75 cols
[2025-05-29 20:26:20] [INFO ] Computed 13 invariants in 8 ms
[2025-05-29 20:26:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 721/740 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 17/757 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/757 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/757 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 80/837 variables, 48/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/837 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/837 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/840 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/840 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/840 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/840 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 840/840 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 75/75 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/19 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 721/740 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 17/757 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem smplace_385 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 373ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 765/765 transitions.
Graph (complete) has 850 edges and 75 vertex of which 68 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 68 transition count 751
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 17 place count 61 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 60 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 60 transition count 750
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 56 transition count 746
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 54 place count 56 transition count 719
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 56 transition count 718
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 55 transition count 717
Applied a total of 57 rules in 98 ms. Remains 55 /75 variables (removed 20) and now considering 717/765 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 55/75 places, 717/765 transitions.
Total runtime 20131 ms.
ITS solved all properties within timeout

BK_STOP 1748550381781

--------------------
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="AutonomousCar-PT-09b"
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 AutonomousCar-PT-09b, 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 r014-tall-174853744100463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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