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.r154-tall-174876825100123.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 NoC3x3-PT-3B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-tall-174876825100123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.4K 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.1K 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 8.2K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K 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 50K 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.6K 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 581K 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 1748841570019

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-02 05:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-02 05:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 05:19:31] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2025-06-02 05:19:31] [INFO ] Transformed 2117 places.
[2025-06-02 05:19:31] [INFO ] Transformed 2435 transitions.
[2025-06-02 05:19:31] [INFO ] Found NUPN structural information;
[2025-06-02 05:19:31] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 284 ms.
Graph (trivial) has 1749 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 10 ms
Free SCC test removed 63 places
Structural test allowed to assert that 340 places are NOT stable. Took 45 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
RANDOM walk for 40000 steps (100 resets) in 3669 ms. (10 steps per ms) remains 246/1777 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 16 ms. (23 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 401 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 20 ms. (19 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 246/246 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 246/246 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 246/246 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 246/246 properties
[2025-06-02 05:19:33] [INFO ] Flow matrix only has 2364 transitions (discarded 8 similar events)
// Phase 1: matrix 2364 rows 2054 cols
[2025-06-02 05:19:33] [INFO ] Computed 66 invariants in 33 ms
[2025-06-02 05:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 246/246 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1118/1364 variables, 36/282 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 1118/1400 constraints. Problems are: Problem set: 0 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1364/4418 variables, and 1400 constraints, problems are : Problem set: 0 solved, 246 unsolved in 5171 ms.
Refiners :[Domain max(s): 1364/2054 constraints, Positive P Invariants (semi-flows): 36/66 constraints, State Equation: 0/2054 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 246/246 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (OVERLAPS) 1118/1364 variables, 36/282 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1364 variables, 1118/1400 constraints. Problems are: Problem set: 0 solved, 246 unsolved
[2025-06-02 05:19:40] [INFO ] Deduced a trap composed of 32 places in 416 ms of which 53 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 34 places in 553 ms of which 10 ms to minimize.
[2025-06-02 05:19:41] [INFO ] Deduced a trap composed of 72 places in 558 ms of which 6 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 57 places in 447 ms of which 6 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 99 places in 306 ms of which 6 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 120 places in 327 ms of which 6 ms to minimize.
[2025-06-02 05:19:42] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 3 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 4 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 4 ms to minimize.
[2025-06-02 05:19:43] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 4 ms to minimize.
SMT process timed out in 10496ms, After SMT, problems are : Problem set: 0 solved, 246 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 246 out of 2054 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2054/2054 places, 2372/2372 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 375 rules applied. Total rules applied 375 place count 2049 transition count 2002
Reduce places removed 361 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 363 rules applied. Total rules applied 738 place count 1688 transition count 2000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 739 place count 1687 transition count 2000
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 739 place count 1687 transition count 1976
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 787 place count 1663 transition count 1976
Discarding 281 places :
Symmetric choice reduction at 3 with 281 rule applications. Total rules 1068 place count 1382 transition count 1695
Iterating global reduction 3 with 281 rules applied. Total rules applied 1349 place count 1382 transition count 1695
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1349 place count 1382 transition count 1682
Deduced a syphon composed of 13 places in 11 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1375 place count 1369 transition count 1682
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 1477 place count 1267 transition count 1580
Iterating global reduction 3 with 102 rules applied. Total rules applied 1579 place count 1267 transition count 1580
Discarding 104 places :
Symmetric choice reduction at 3 with 104 rule applications. Total rules 1683 place count 1163 transition count 1465
Iterating global reduction 3 with 104 rules applied. Total rules applied 1787 place count 1163 transition count 1465
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1817 place count 1133 transition count 1408
Iterating global reduction 3 with 30 rules applied. Total rules applied 1847 place count 1133 transition count 1408
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 1858 place count 1133 transition count 1397
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 1877 place count 1114 transition count 1378
Iterating global reduction 4 with 19 rules applied. Total rules applied 1896 place count 1114 transition count 1378
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1905 place count 1105 transition count 1360
Iterating global reduction 4 with 9 rules applied. Total rules applied 1914 place count 1105 transition count 1360
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1923 place count 1096 transition count 1351
Iterating global reduction 4 with 9 rules applied. Total rules applied 1932 place count 1096 transition count 1351
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 4 with 11 rules applied. Total rules applied 1943 place count 1095 transition count 1341
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1944 place count 1094 transition count 1341
Performed 304 Post agglomeration using F-continuation condition.Transition count delta: 304
Deduced a syphon composed of 304 places in 1 ms
Reduce places removed 304 places and 0 transitions.
Iterating global reduction 6 with 608 rules applied. Total rules applied 2552 place count 790 transition count 1037
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 2562 place count 780 transition count 1027
Iterating global reduction 6 with 10 rules applied. Total rules applied 2572 place count 780 transition count 1027
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2574 place count 778 transition count 1023
Iterating global reduction 6 with 2 rules applied. Total rules applied 2576 place count 778 transition count 1023
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2577 place count 777 transition count 1018
Iterating global reduction 6 with 1 rules applied. Total rules applied 2578 place count 777 transition count 1018
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -144
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 2632 place count 750 transition count 1162
Free-agglomeration rule applied 42 times.
Iterating global reduction 6 with 42 rules applied. Total rules applied 2674 place count 750 transition count 1120
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 51 rules applied. Total rules applied 2725 place count 708 transition count 1111
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 2727 place count 708 transition count 1109
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2732 place count 708 transition count 1104
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2737 place count 703 transition count 1104
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 2753 place count 703 transition count 1104
Partial Post-agglomeration rule applied 18 times.
Drop transitions (Partial Post agglomeration) removed 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 2771 place count 703 transition count 1104
Applied a total of 2771 rules in 1121 ms. Remains 703 /2054 variables (removed 1351) and now considering 1104/2372 (removed 1268) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1154 ms. Remains : 703/2054 places, 1104/2372 transitions.
RANDOM walk for 4000000 steps (54529 resets) in 30255 ms. (132 steps per ms) remains 4/246 properties
BEST_FIRST walk for 4000004 steps (3058 resets) in 4869 ms. (821 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (3081 resets) in 4830 ms. (827 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (3072 resets) in 4839 ms. (826 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (3065 resets) in 4964 ms. (805 steps per ms) remains 4/4 properties
[2025-06-02 05:19:58] [INFO ] Flow matrix only has 1102 transitions (discarded 2 similar events)
// Phase 1: matrix 1102 rows 703 cols
[2025-06-02 05:19:58] [INFO ] Computed 60 invariants in 9 ms
[2025-06-02 05:19:58] [INFO ] State equation strengthened by 84 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 633/676 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1093/1769 variables, 676/736 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1769 variables, 76/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1769 variables, 0/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 36/1805 variables, 27/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1805 variables, 8/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1805 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1805 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1805/1805 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 601 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 703/703 constraints, ReadFeed: 84/84 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 39/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 633/676 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 6 places in 153 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 6 places in 156 ms of which 3 ms to minimize.
[2025-06-02 05:19:59] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 3 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 3 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 2 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 3 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 3 ms to minimize.
[2025-06-02 05:20:00] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 3 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 3 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 16 places in 117 ms of which 2 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2025-06-02 05:20:01] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem smplace_372 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 3532ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 703 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 703/703 places, 1104/1104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 703 transition count 1022
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 1 with 84 rules applied. Total rules applied 166 place count 621 transition count 1020
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 620 transition count 1020
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 167 place count 620 transition count 1003
Deduced a syphon composed of 17 places in 4 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 201 place count 603 transition count 1003
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 233 place count 571 transition count 969
Iterating global reduction 3 with 32 rules applied. Total rules applied 265 place count 571 transition count 969
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 278 place count 558 transition count 956
Iterating global reduction 3 with 13 rules applied. Total rules applied 291 place count 558 transition count 956
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 296 place count 553 transition count 946
Iterating global reduction 3 with 5 rules applied. Total rules applied 301 place count 553 transition count 946
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 305 place count 549 transition count 941
Iterating global reduction 3 with 4 rules applied. Total rules applied 309 place count 549 transition count 941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 3 with 4 rules applied. Total rules applied 313 place count 548 transition count 938
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 314 place count 547 transition count 938
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 316 place count 545 transition count 934
Iterating global reduction 5 with 2 rules applied. Total rules applied 318 place count 545 transition count 934
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 325 place count 545 transition count 927
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 469 place count 473 transition count 855
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 470 place count 473 transition count 854
Discarding 52 places :
Symmetric choice reduction at 7 with 52 rule applications. Total rules 522 place count 421 transition count 656
Iterating global reduction 7 with 52 rules applied. Total rules applied 574 place count 421 transition count 656
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 575 place count 421 transition count 655
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 585 place count 411 transition count 635
Iterating global reduction 8 with 10 rules applied. Total rules applied 595 place count 411 transition count 635
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 600 place count 411 transition count 630
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 603 place count 408 transition count 624
Iterating global reduction 9 with 3 rules applied. Total rules applied 606 place count 408 transition count 624
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 609 place count 408 transition count 621
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 611 place count 408 transition count 619
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 612 place count 408 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 613 place count 407 transition count 618
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 619 place count 407 transition count 618
Applied a total of 619 rules in 186 ms. Remains 407 /703 variables (removed 296) and now considering 618/1104 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 407/703 places, 618/1104 transitions.
Total runtime 30692 ms.
ITS solved all properties within timeout

BK_STOP 1748841602399

--------------------
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="NoC3x3-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 NoC3x3-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 r154-tall-174876825100123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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