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-171654364100363.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-2B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-171654364100363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 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 548K 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 1716636807130

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-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 11:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-25 11:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:33:28] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2024-05-25 11:33:28] [INFO ] Transformed 2003 places.
[2024-05-25 11:33:28] [INFO ] Transformed 2292 transitions.
[2024-05-25 11:33:28] [INFO ] Found NUPN structural information;
[2024-05-25 11:33:28] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 315 ms.
Graph (trivial) has 1634 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 8 ms
Free SCC test removed 63 places
Structural test allowed to assert that 332 places are NOT stable. Took 41 ms.
Ensure Unique test removed 63 transitions
Reduce redundant transitions removed 63 transitions.
RANDOM walk for 40000 steps (102 resets) in 3132 ms. (12 steps per ms) remains 231/1671 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 11 ms. (33 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 4 ms. (80 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 5 ms. (67 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 231/231 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 402 steps (8 resets) in 6 ms. (57 steps per ms) remains 231/231 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 231/231 properties
[2024-05-25 11:33:30] [INFO ] Flow matrix only has 2221 transitions (discarded 8 similar events)
// Phase 1: matrix 2221 rows 1940 cols
[2024-05-25 11:33:30] [INFO ] Computed 66 invariants in 36 ms
[2024-05-25 11:33:30] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 231/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 949/1180 variables, 31/262 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1180 variables, 949/1211 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 (/ 49.0 50.0))
(s66 (/ 1.0 50.0))
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 (/ 1.0 50.0))
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 (/ 49.0 50.0))
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s143 (/ 41.0 50.0))
(s144 (/ 1.0 50.0))
(s145 (/ 1.0 50.0))
(s146 (/ 1.0 50.0))
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 (/ 1.0 50.0))
(s151 (/ 1.0 50.0))
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 (/ 1.0 50.0))
(s157 (/ 1.0 50.0))
(s158 (/ 1.0 50.0))
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 (/ 1.0 50.0))
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s178 0.0)
(s179 (/ 1.0 50.0))
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 50.0))
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 (/ 24.0 25.0))
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 (/ 37.0 50.0))
(s203 (/ 1.0 50.0))
(s204 (/ 1.0 50.0))
(s205 (/ 1.0 50.0))
(s206 (/ 1.0 50.0))
(s207 (/ 1.0 50.0))
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 (/ 1.0 50.0))
(s216 (/ 1.0 50.0))
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 (/ 1.0 50.0))
(s228 (/ 1.0 50.0))
(s229 (/ 1.0 50.0))
(s230 (/ 1.0 50.0))
(s231 (/ 1.0 50.0))
(s232 (/ 1.0 50.0))
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s363 0.0)
(s364 (/ 1.0 50.0))
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 (/ 24.0 25.0))
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 (/ 1.0 50.0))
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s463 0.0)
(s464 (/ 1.0 50.0))
(s465 (/ 18.0 25.0))
(s466 (/ 1.0 50.0))
(s467 (/ 1.0 50.0))
(s468 (/ 1.0 50.0))
(s469 (/ 1.0 50.0))
(s470 (/ 1.0 50.0))
(s471 (/ 1.0 50.0))
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 (/ 1.0 50.0))
(s477 (/ 1.0 50.0))
(s478 (/ 1.0 50.0))
(s479 (/ 1.0 50.0))
(s480 (/ 1.0 50.0))
(s481 (/ 1.0 50.0))
(s482 (/ 1.0 50.0))
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s502 0.0)
(s503 0.0)
(s504 (/ 1.0 50.0))
(s505 (/ 1.0 50.0))
(s506 (/ 1.0 50.0))
(s507 (/ 1.0 50.0))
(s508 (/ 41.0 50.0))
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 (/ 1.0 50.0))
(s514 (/ 1.0 50.0))
(s515 (/ 1.0 50.0))
(s516 (/ 1.0 50.0))
(s517 (/ 1.0 50.0))
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 (/ 9.0 10.0))
(s556 0.0)
(s557 (/ 1.0 50.0))
(s558 (/ 1.0 50.0))
(s559 (/ 1.0 50.0))
(s560 (/ 1.0 50.0))
(s561 (/ 1.0 50.0))
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s675 0.0)
(s676 (/ 1.0 50.0))
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 (/ 1.0 50.0))
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 (/ 1.0 50.0))
(s687 (/ 23.0 25.0))
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 (/ 1.0 50.0))
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 (/ 47.0 50.0))
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 (/ 1.0 50.0))
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 (/ 1.0 50.0))
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 (/ 1.0 50.0))
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 (/ 1.0 50.0))
(s740 (/ 1.0 50.0))
(s741 (/ 1.0 50.0))
(s742 (/ 1.0 50.0))
(s743 timeout
(/ 1.0 50.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1180/4161 variables, and 1211 constraints, problems are : Problem set: 0 solved, 231 unsolved in 5064 ms.
Refiners :[Domain max(s): 1180/1940 constraints, Positive P Invariants (semi-flows): 31/66 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 231/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/231 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 949/1180 variables, 31/262 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1180 variables, 949/1211 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-25 11:33:37] [INFO ] Deduced a trap composed of 15 places in 376 ms of which 50 ms to minimize.
[2024-05-25 11:33:37] [INFO ] Deduced a trap composed of 31 places in 282 ms of which 5 ms to minimize.
[2024-05-25 11:33:37] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 5 ms to minimize.
[2024-05-25 11:33:38] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 4 ms to minimize.
[2024-05-25 11:33:38] [INFO ] Deduced a trap composed of 81 places in 229 ms of which 4 ms to minimize.
[2024-05-25 11:33:38] [INFO ] Deduced a trap composed of 52 places in 202 ms of which 4 ms to minimize.
[2024-05-25 11:33:38] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 3 ms to minimize.
[2024-05-25 11:33:39] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 4 ms to minimize.
[2024-05-25 11:33:39] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 3 ms to minimize.
[2024-05-25 11:33:39] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2024-05-25 11:33:39] [INFO ] Deduced a trap composed of 69 places in 92 ms of which 2 ms to minimize.
[2024-05-25 11:33:39] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 1 ms to minimize.
[2024-05-25 11:33:39] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-25 11:33:40] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2024-05-25 11:33:40] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1180/4161 variables, and 1226 constraints, problems are : Problem set: 0 solved, 231 unsolved in 5009 ms.
Refiners :[Domain max(s): 1180/1940 constraints, Positive P Invariants (semi-flows): 31/66 constraints, State Equation: 0/1940 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/231 constraints, Known Traps: 15/15 constraints]
After SMT, in 10287ms problems are : Problem set: 0 solved, 231 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 231 out of 1940 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1940/1940 places, 2229/2229 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 352 rules applied. Total rules applied 352 place count 1932 transition count 1885
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 687 place count 1597 transition count 1885
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 687 place count 1597 transition count 1861
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 735 place count 1573 transition count 1861
Discarding 269 places :
Symmetric choice reduction at 2 with 269 rule applications. Total rules 1004 place count 1304 transition count 1592
Iterating global reduction 2 with 269 rules applied. Total rules applied 1273 place count 1304 transition count 1592
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 1273 place count 1304 transition count 1579
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 1299 place count 1291 transition count 1579
Discarding 98 places :
Symmetric choice reduction at 2 with 98 rule applications. Total rules 1397 place count 1193 transition count 1481
Iterating global reduction 2 with 98 rules applied. Total rules applied 1495 place count 1193 transition count 1481
Discarding 97 places :
Symmetric choice reduction at 2 with 97 rule applications. Total rules 1592 place count 1096 transition count 1371
Iterating global reduction 2 with 97 rules applied. Total rules applied 1689 place count 1096 transition count 1371
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1718 place count 1067 transition count 1318
Iterating global reduction 2 with 29 rules applied. Total rules applied 1747 place count 1067 transition count 1318
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 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 2 with 15 rules applied. Total rules applied 1762 place count 1066 transition count 1304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1763 place count 1065 transition count 1304
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1779 place count 1049 transition count 1288
Iterating global reduction 4 with 16 rules applied. Total rules applied 1795 place count 1049 transition count 1288
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1803 place count 1041 transition count 1272
Iterating global reduction 4 with 8 rules applied. Total rules applied 1811 place count 1041 transition count 1272
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1819 place count 1033 transition count 1264
Iterating global reduction 4 with 8 rules applied. Total rules applied 1827 place count 1033 transition count 1264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 10 rules applied. Total rules applied 1837 place count 1032 transition count 1255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1838 place count 1031 transition count 1255
Performed 295 Post agglomeration using F-continuation condition.Transition count delta: 295
Deduced a syphon composed of 295 places in 0 ms
Reduce places removed 295 places and 0 transitions.
Iterating global reduction 6 with 590 rules applied. Total rules applied 2428 place count 736 transition count 960
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 2437 place count 727 transition count 951
Iterating global reduction 6 with 9 rules applied. Total rules applied 2446 place count 727 transition count 951
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2450 place count 723 transition count 943
Iterating global reduction 6 with 4 rules applied. Total rules applied 2454 place count 723 transition count 943
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2455 place count 722 transition count 938
Iterating global reduction 6 with 1 rules applied. Total rules applied 2456 place count 722 transition count 938
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -137
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2512 place count 694 transition count 1075
Free-agglomeration rule applied 43 times.
Iterating global reduction 6 with 43 rules applied. Total rules applied 2555 place count 694 transition count 1032
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 52 rules applied. Total rules applied 2607 place count 651 transition count 1023
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 2609 place count 651 transition count 1021
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 2614 place count 651 transition count 1016
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2619 place count 646 transition count 1016
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 2627 place count 646 transition count 1016
Partial Post-agglomeration rule applied 8 times.
Drop transitions (Partial Post agglomeration) removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 2635 place count 646 transition count 1016
Applied a total of 2635 rules in 932 ms. Remains 646 /1940 variables (removed 1294) and now considering 1016/2229 (removed 1213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 942 ms. Remains : 646/1940 places, 1016/2229 transitions.
RANDOM walk for 4000000 steps (54320 resets) in 27916 ms. (143 steps per ms) remains 3/231 properties
BEST_FIRST walk for 4000004 steps (3103 resets) in 5260 ms. (760 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3075 resets) in 5096 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (3107 resets) in 5064 ms. (789 steps per ms) remains 3/3 properties
// Phase 1: matrix 1016 rows 646 cols
[2024-05-25 11:33:52] [INFO ] Computed 58 invariants in 9 ms
[2024-05-25 11:33:52] [INFO ] State equation strengthened by 77 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 567/607 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1002/1609 variables, 607/665 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1609 variables, 67/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1609 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 53/1662 variables, 39/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1662 variables, 10/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1662 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1662 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 781 constraints, problems are : Problem set: 0 solved, 3 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, State Equation: 646/646 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 37/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 567/607 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 6 places in 115 ms of which 2 ms to minimize.
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 3 ms to minimize.
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 4 ms to minimize.
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 1 ms to minimize.
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 2 ms to minimize.
[2024-05-25 11:33:53] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-05-25 11:33:54] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-25 11:33:54] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2024-05-25 11:33:54] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-25 11:33:54] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-25 11:33:54] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/607 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/607 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1002/1609 variables, 607/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1609 variables, 67/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1609 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1609 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem smplace_144 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST TRIVIAL_UNMARKED_SCC_TEST SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 2118ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 646 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 646/646 places, 1016/1016 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 645 transition count 946
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 575 transition count 946
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 141 place count 575 transition count 938
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 157 place count 567 transition count 938
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 190 place count 534 transition count 904
Iterating global reduction 2 with 33 rules applied. Total rules applied 223 place count 534 transition count 904
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 223 place count 534 transition count 903
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 225 place count 533 transition count 903
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 239 place count 519 transition count 885
Iterating global reduction 2 with 14 rules applied. Total rules applied 253 place count 519 transition count 885
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 261 place count 511 transition count 871
Iterating global reduction 2 with 8 rules applied. Total rules applied 269 place count 511 transition count 871
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 274 place count 506 transition count 864
Iterating global reduction 2 with 5 rules applied. Total rules applied 279 place count 506 transition count 864
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 281 place count 506 transition count 862
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 283 place count 504 transition count 859
Iterating global reduction 3 with 2 rules applied. Total rules applied 285 place count 504 transition count 859
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 504 transition count 857
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 288 place count 503 transition count 855
Iterating global reduction 4 with 1 rules applied. Total rules applied 289 place count 503 transition count 855
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 290 place count 502 transition count 854
Iterating global reduction 4 with 1 rules applied. Total rules applied 291 place count 502 transition count 854
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 6 rules applied. Total rules applied 297 place count 501 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 298 place count 500 transition count 849
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 424 place count 437 transition count 786
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 463 place count 398 transition count 613
Iterating global reduction 6 with 39 rules applied. Total rules applied 502 place count 398 transition count 613
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 510 place count 390 transition count 597
Iterating global reduction 6 with 8 rules applied. Total rules applied 518 place count 390 transition count 597
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 522 place count 390 transition count 593
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 524 place count 388 transition count 589
Iterating global reduction 7 with 2 rules applied. Total rules applied 526 place count 388 transition count 589
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 528 place count 388 transition count 587
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 534 place count 385 transition count 588
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 535 place count 384 transition count 586
Iterating global reduction 8 with 1 rules applied. Total rules applied 536 place count 384 transition count 586
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 537 place count 384 transition count 585
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 538 place count 384 transition count 584
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 542 place count 384 transition count 580
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 546 place count 380 transition count 580
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 547 place count 380 transition count 579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 548 place count 379 transition count 579
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 553 place count 379 transition count 579
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 554 place count 378 transition count 576
Iterating global reduction 11 with 1 rules applied. Total rules applied 555 place count 378 transition count 576
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 556 place count 378 transition count 575
Applied a total of 556 rules in 201 ms. Remains 378 /646 variables (removed 268) and now considering 575/1016 (removed 441) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 378/646 places, 575/1016 transitions.
Total runtime 26397 ms.
ITS solved all properties within timeout

BK_STOP 1716636835292

--------------------
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-2B"
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-2B, 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-171654364100363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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