Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r254-tall-171654364100373.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
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 r254-tall-171654364100373
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 12 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 12 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 12 07:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 581K May 18 16:43 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 1716636849200

Invoking MCC driver with
BK_TOOL=greatspnxred
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
[2024-05-25 11:34:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-25 11:34:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:34:10] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2024-05-25 11:34:10] [INFO ] Transformed 2117 places.
[2024-05-25 11:34:10] [INFO ] Transformed 2435 transitions.
[2024-05-25 11:34:10] [INFO ] Found NUPN structural information;
[2024-05-25 11:34:10] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 279 ms.
Graph (trivial) has 1749 edges and 2117 vertex of which 72 / 2117 are part of one of the 9 SCC in 9 ms
Free SCC test removed 63 places
Structural test allowed to assert that 340 places are NOT stable. Took 46 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
RANDOM walk for 40000 steps (105 resets) in 3631 ms. (11 steps per ms) remains 291/1777 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 291/291 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 291/291 properties
BEST_FIRST walk for 401 steps (8 resets) in 25 ms. (15 steps per ms) remains 291/291 properties
BEST_FIRST walk for 402 steps (8 resets) in 26 ms. (14 steps per ms) remains 291/291 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 291/291 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 21 ms. (18 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 18 ms. (21 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 402 steps (8 resets) in 19 ms. (20 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 22 ms. (17 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 291/291 properties
BEST_FIRST walk for 402 steps (8 resets) in 23 ms. (16 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 291/291 properties
BEST_FIRST walk for 401 steps (8 resets) in 13 ms. (28 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 291/291 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 291/291 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 291/291 properties
[2024-05-25 11:34:12] [INFO ] Flow matrix only has 2364 transitions (discarded 8 similar events)
// Phase 1: matrix 2364 rows 2054 cols
[2024-05-25 11:34:12] [INFO ] Computed 66 invariants in 32 ms
[2024-05-25 11:34:12] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 291/291 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/4418 variables, and 291 constraints, problems are : Problem set: 0 solved, 291 unsolved in 5047 ms.
Refiners :[Domain max(s): 291/2054 constraints, Positive P Invariants (semi-flows): 0/66 constraints, State Equation: 0/2054 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 291/291 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 978/1269 variables, 33/324 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1269 variables, 978/1302 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-25 11:34:19] [INFO ] Deduced a trap composed of 34 places in 372 ms of which 44 ms to minimize.
[2024-05-25 11:34:20] [INFO ] Deduced a trap composed of 40 places in 495 ms of which 6 ms to minimize.
[2024-05-25 11:34:20] [INFO ] Deduced a trap composed of 65 places in 538 ms of which 5 ms to minimize.
[2024-05-25 11:34:21] [INFO ] Deduced a trap composed of 28 places in 207 ms of which 4 ms to minimize.
[2024-05-25 11:34:21] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 4 ms to minimize.
[2024-05-25 11:34:21] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 4 ms to minimize.
[2024-05-25 11:34:21] [INFO ] Deduced a trap composed of 73 places in 197 ms of which 4 ms to minimize.
[2024-05-25 11:34:21] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 4 ms to minimize.
[2024-05-25 11:34:22] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 3 ms to minimize.
[2024-05-25 11:34:22] [INFO ] Deduced a trap composed of 57 places in 150 ms of which 4 ms to minimize.
[2024-05-25 11:34:22] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2024-05-25 11:34:22] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
SMT process timed out in 10425ms, After SMT, problems are : Problem set: 0 solved, 291 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 291 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 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 363 rules applied. Total rules applied 363 place count 2050 transition count 2013
Reduce places removed 350 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 352 rules applied. Total rules applied 715 place count 1700 transition count 2011
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1699 transition count 2011
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 716 place count 1699 transition count 1987
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 764 place count 1675 transition count 1987
Discarding 274 places :
Symmetric choice reduction at 3 with 274 rule applications. Total rules 1038 place count 1401 transition count 1713
Iterating global reduction 3 with 274 rules applied. Total rules applied 1312 place count 1401 transition count 1713
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1312 place count 1401 transition count 1698
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1342 place count 1386 transition count 1698
Discarding 101 places :
Symmetric choice reduction at 3 with 101 rule applications. Total rules 1443 place count 1285 transition count 1597
Iterating global reduction 3 with 101 rules applied. Total rules applied 1544 place count 1285 transition count 1597
Discarding 102 places :
Symmetric choice reduction at 3 with 102 rule applications. Total rules 1646 place count 1183 transition count 1482
Iterating global reduction 3 with 102 rules applied. Total rules applied 1748 place count 1183 transition count 1482
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1779 place count 1152 transition count 1429
Iterating global reduction 3 with 31 rules applied. Total rules applied 1810 place count 1152 transition count 1429
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 with 17 rules applied. Total rules applied 1827 place count 1150 transition count 1414
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1829 place count 1148 transition count 1414
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 1847 place count 1130 transition count 1396
Iterating global reduction 5 with 18 rules applied. Total rules applied 1865 place count 1130 transition count 1396
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1874 place count 1121 transition count 1378
Iterating global reduction 5 with 9 rules applied. Total rules applied 1883 place count 1121 transition count 1378
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1892 place count 1112 transition count 1369
Iterating global reduction 5 with 9 rules applied. Total rules applied 1901 place count 1112 transition count 1369
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 5 with 11 rules applied. Total rules applied 1912 place count 1111 transition count 1359
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1913 place count 1110 transition count 1359
Performed 296 Post agglomeration using F-continuation condition.Transition count delta: 296
Deduced a syphon composed of 296 places in 2 ms
Reduce places removed 296 places and 0 transitions.
Iterating global reduction 7 with 592 rules applied. Total rules applied 2505 place count 814 transition count 1063
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 2518 place count 801 transition count 1050
Iterating global reduction 7 with 13 rules applied. Total rules applied 2531 place count 801 transition count 1050
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2535 place count 797 transition count 1042
Iterating global reduction 7 with 4 rules applied. Total rules applied 2539 place count 797 transition count 1042
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2540 place count 797 transition count 1041
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2541 place count 796 transition count 1036
Iterating global reduction 8 with 1 rules applied. Total rules applied 2542 place count 796 transition count 1036
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -149
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 2596 place count 769 transition count 1185
Free-agglomeration rule applied 40 times.
Iterating global reduction 8 with 40 rules applied. Total rules applied 2636 place count 769 transition count 1145
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 47 rules applied. Total rules applied 2683 place count 729 transition count 1138
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 2684 place count 729 transition count 1137
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 9 with 3 rules applied. Total rules applied 2687 place count 729 transition count 1134
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2690 place count 726 transition count 1134
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 2709 place count 726 transition count 1134
Partial Post-agglomeration rule applied 11 times.
Drop transitions (Partial Post agglomeration) removed 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 2720 place count 726 transition count 1134
Applied a total of 2720 rules in 850 ms. Remains 726 /2054 variables (removed 1328) and now considering 1134/2372 (removed 1238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 861 ms. Remains : 726/2054 places, 1134/2372 transitions.
RANDOM walk for 4000000 steps (53914 resets) in 29388 ms. (136 steps per ms) remains 4/291 properties
BEST_FIRST walk for 4000003 steps (3077 resets) in 5483 ms. (729 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (3023 resets) in 5454 ms. (733 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (3047 resets) in 5437 ms. (735 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (3059 resets) in 5379 ms. (743 steps per ms) remains 4/4 properties
[2024-05-25 11:34:37] [INFO ] Flow matrix only has 1132 transitions (discarded 2 similar events)
// Phase 1: matrix 1132 rows 726 cols
[2024-05-25 11:34:37] [INFO ] Computed 60 invariants in 15 ms
[2024-05-25 11:34:37] [INFO ] State equation strengthened by 86 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) 47/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 643/694 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1118/1812 variables, 694/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1812 variables, 76/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1812 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 46/1858 variables, 32/862 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1858 variables, 10/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1858 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1858 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1858/1858 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, State Equation: 726/726 constraints, ReadFeed: 86/86 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) 47/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 643/694 variables, 57/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 11:34:38] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 4 ms to minimize.
[2024-05-25 11:34:38] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 3 ms to minimize.
[2024-05-25 11:34:38] [INFO ] Deduced a trap composed of 7 places in 191 ms of which 3 ms to minimize.
[2024-05-25 11:34:38] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
[2024-05-25 11:34:38] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 3 ms to minimize.
[2024-05-25 11:34:39] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 3 ms to minimize.
[2024-05-25 11:34:39] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 3 ms to minimize.
[2024-05-25 11:34:39] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-05-25 11:34:39] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 2 ms to minimize.
[2024-05-25 11:34:39] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 3 ms to minimize.
[2024-05-25 11:34:39] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 3 ms to minimize.
[2024-05-25 11:34:40] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 2 ms to minimize.
[2024-05-25 11:34:40] [INFO ] Deduced a trap composed of 7 places in 138 ms of which 3 ms to minimize.
[2024-05-25 11:34:40] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 3 ms to minimize.
[2024-05-25 11:34:40] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 2 ms to minimize.
[2024-05-25 11:34:40] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 3 ms to minimize.
[2024-05-25 11:34:40] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-25 11:34:41] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 3 ms to minimize.
[2024-05-25 11:34:41] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 2 ms to minimize.
[2024-05-25 11:34:41] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-25 11:34:41] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-25 11:34:41] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-25 11:34:41] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-05-25 11:34:42] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-25 11:34:42] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/694 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/694 variables, 0/85 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 5298ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1134/1134 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 725 transition count 1041
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 632 transition count 1040
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 188 place count 632 transition count 1030
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 208 place count 622 transition count 1030
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 253 place count 577 transition count 980
Iterating global reduction 2 with 45 rules applied. Total rules applied 298 place count 577 transition count 980
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 298 place count 577 transition count 978
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 302 place count 575 transition count 978
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 320 place count 557 transition count 953
Iterating global reduction 2 with 18 rules applied. Total rules applied 338 place count 557 transition count 953
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 348 place count 547 transition count 933
Iterating global reduction 2 with 10 rules applied. Total rules applied 358 place count 547 transition count 933
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 362 place count 547 transition count 929
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 368 place count 541 transition count 922
Iterating global reduction 3 with 6 rules applied. Total rules applied 374 place count 541 transition count 922
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
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 3 with 6 rules applied. Total rules applied 380 place count 539 transition count 918
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 382 place count 537 transition count 918
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 383 place count 536 transition count 916
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 536 transition count 916
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 388 place count 536 transition count 912
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 540 place count 460 transition count 836
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 541 place count 460 transition count 835
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 590 place count 411 transition count 650
Iterating global reduction 7 with 49 rules applied. Total rules applied 639 place count 411 transition count 650
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 640 place count 411 transition count 649
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 648 place count 403 transition count 633
Iterating global reduction 8 with 8 rules applied. Total rules applied 656 place count 403 transition count 633
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 663 place count 403 transition count 626
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 664 place count 402 transition count 624
Iterating global reduction 9 with 1 rules applied. Total rules applied 665 place count 402 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 668 place count 402 transition count 621
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 674 place count 399 transition count 624
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 676 place count 399 transition count 622
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 684 place count 399 transition count 622
Applied a total of 684 rules in 186 ms. Remains 399 /726 variables (removed 327) and now considering 622/1134 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 399/726 places, 622/1134 transitions.
Total runtime 32246 ms.
ITS solved all properties within timeout

BK_STOP 1716636882981

--------------------
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="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
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 r254-tall-171654364100373"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;