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.r246-tall-171654352000598.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 itstools
Input is NoC3x3-PT-3B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-tall-171654352000598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-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 6.1K May 18 16:43 GenericPropertiesVerdict.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

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-3B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716697130245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-26 04:18:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 04:18:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 04:18:51] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-26 04:18:51] [INFO ] Transformed 2117 places.
[2024-05-26 04:18:51] [INFO ] Transformed 2435 transitions.
[2024-05-26 04:18:51] [INFO ] Found NUPN structural information;
[2024-05-26 04:18:51] [INFO ] Parsed PT model containing 2117 places and 2435 transitions and 6177 arcs in 273 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (66 resets) in 1578 ms. (25 steps per ms) remains 5/12 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 486 ms. (82 steps per ms) remains 5/5 properties
[2024-05-26 04:18:52] [INFO ] Flatten gal took : 409 ms
BEST_FIRST walk for 40002 steps (8 resets) in 519 ms. (76 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (9 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
[2024-05-26 04:18:52] [INFO ] Flatten gal took : 192 ms
[2024-05-26 04:18:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11050529073560605463.gal : 56 ms
[2024-05-26 04:18:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2497528192554515988.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11050529073560605463.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2497528192554515988.prop' '--nowitness' '--gen-order' 'FOLLOW'
// Phase 1: matrix 2435 rows 2117 cols

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
[2024-05-26 04:18:53] [INFO ] Computed 66 invariants in 38 ms
Loading property file /tmp/ReachabilityCardinality2497528192554515988.prop.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 73/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem NoC3x3-PT-3B-ReachabilityCardinality-2024-05 is UNSAT
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1822/1895 variables, 52/125 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1895 variables, 1822/1947 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1895 variables, 0/1947 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 222/2117 variables, 14/1961 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2117 variables, 222/2183 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 0/2183 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2435/4552 variables, 2117/4300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/4552 variables, 0/4300 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4552/4552 variables, and 4300 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1878 ms.
Refiners :[Domain max(s): 2117/2117 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2117/2117 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1612/1652 variables, 45/85 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1652 variables, 1612/1697 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-26 04:18:55] [INFO ] Deduced a trap composed of 59 places in 297 ms of which 62 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
[2024-05-26 04:18:56] [INFO ] Deduced a trap composed of 64 places in 268 ms of which 26 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 10
[2024-05-26 04:18:56] [INFO ] Deduced a trap composed of 81 places in 233 ms of which 4 ms to minimize.
[2024-05-26 04:18:56] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 3 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :10 after 19
[2024-05-26 04:18:56] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 1 ms to minimize.
[2024-05-26 04:18:56] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :19 after 36
[2024-05-26 04:18:57] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 3 ms to minimize.
[2024-05-26 04:18:57] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :36 after 66
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :66 after 509
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :509 after 684
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :684 after 1971
[2024-05-26 04:18:57] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 4 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1971 after 8420
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :8420 after 475439
[2024-05-26 04:18:57] [INFO ] Deduced a trap composed of 86 places in 84 ms of which 2 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 4096
At refinement iteration 4 (INCLUDED_ONLY) 0/1652 variables, 10/1707 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD size :475439 after 2.27753e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/1652 variables, 0/1707 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 465/2117 variables, 21/1728 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2117 variables, 465/2193 constraints. Problems are: Problem set: 1 solved, 4 unsolved
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :2.27753e+08 after 3.89501e+09
[2024-05-26 04:18:58] [INFO ] Deduced a trap composed of 36 places in 449 ms of which 7 ms to minimize.
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :3.89501e+09 after 1.62956e+10
[2024-05-26 04:18:58] [INFO ] Deduced a trap composed of 65 places in 446 ms of which 8 ms to minimize.
[2024-05-26 04:18:59] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 7 ms to minimize.
[2024-05-26 04:18:59] [INFO ] Deduced a trap composed of 130 places in 389 ms of which 7 ms to minimize.
[2024-05-26 04:19:00] [INFO ] Deduced a trap composed of 46 places in 409 ms of which 7 ms to minimize.
SMT process timed out in 7111ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 2117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1671 edges and 2117 vertex of which 56 / 2117 are part of one of the 7 SCC in 7 ms
Free SCC test removed 49 places
Drop transitions (Empty/Sink Transition effects.) removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 425 rules applied. Total rules applied 426 place count 2063 transition count 1959
Reduce places removed 420 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 426 rules applied. Total rules applied 852 place count 1643 transition count 1953
Reduce places removed 3 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 15 rules applied. Total rules applied 867 place count 1640 transition count 1941
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 879 place count 1628 transition count 1941
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 879 place count 1628 transition count 1917
Deduced a syphon composed of 24 places in 6 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 927 place count 1604 transition count 1917
Discarding 351 places :
Symmetric choice reduction at 4 with 351 rule applications. Total rules 1278 place count 1253 transition count 1566
Iterating global reduction 4 with 351 rules applied. Total rules applied 1629 place count 1253 transition count 1566
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 1629 place count 1253 transition count 1533
Deduced a syphon composed of 33 places in 9 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 1695 place count 1220 transition count 1533
Discarding 127 places :
Symmetric choice reduction at 4 with 127 rule applications. Total rules 1822 place count 1093 transition count 1369
Iterating global reduction 4 with 127 rules applied. Total rules applied 1949 place count 1093 transition count 1369
Discarding 121 places :
Symmetric choice reduction at 4 with 121 rule applications. Total rules 2070 place count 972 transition count 1235
Iterating global reduction 4 with 121 rules applied. Total rules applied 2191 place count 972 transition count 1235
Discarding 48 places :
Symmetric choice reduction at 4 with 48 rule applications. Total rules 2239 place count 924 transition count 1150
Iterating global reduction 4 with 48 rules applied. Total rules applied 2287 place count 924 transition count 1150
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 2301 place count 923 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2302 place count 922 transition count 1137
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :1.62956e+10 after 1.61883e+11
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 2338 place count 886 transition count 1101
Iterating global reduction 6 with 36 rules applied. Total rules applied 2374 place count 886 transition count 1101
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 2382 place count 882 transition count 1097
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 2386 place count 878 transition count 1097
Discarding 23 places :
Symmetric choice reduction at 8 with 23 rule applications. Total rules 2409 place count 855 transition count 1051
Iterating global reduction 8 with 23 rules applied. Total rules applied 2432 place count 855 transition count 1051
Discarding 23 places :
Symmetric choice reduction at 8 with 23 rule applications. Total rules 2455 place count 832 transition count 1028
Iterating global reduction 8 with 23 rules applied. Total rules applied 2478 place count 832 transition count 1028
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 28 rules applied. Total rules applied 2506 place count 829 transition count 1003
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 2509 place count 826 transition count 1003
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 0 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 10 with 628 rules applied. Total rules applied 3137 place count 512 transition count 689
Discarding 14 places :
Symmetric choice reduction at 10 with 14 rule applications. Total rules 3151 place count 498 transition count 673
Iterating global reduction 10 with 14 rules applied. Total rules applied 3165 place count 498 transition count 673
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 3174 place count 489 transition count 655
Iterating global reduction 10 with 9 rules applied. Total rules applied 3183 place count 489 transition count 655
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3184 place count 489 transition count 654
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3185 place count 488 transition count 652
Iterating global reduction 11 with 1 rules applied. Total rules applied 3186 place count 488 transition count 652
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 3188 place count 487 transition count 651
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -53
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 11 with 38 rules applied. Total rules applied 3226 place count 468 transition count 704
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 3227 place count 467 transition count 702
Iterating global reduction 11 with 1 rules applied. Total rules applied 3228 place count 467 transition count 702
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 3229 place count 467 transition count 701
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 3230 place count 467 transition count 700
Free-agglomeration rule applied 18 times.
Iterating global reduction 12 with 18 rules applied. Total rules applied 3248 place count 467 transition count 682
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 24 rules applied. Total rules applied 3272 place count 449 transition count 676
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 3274 place count 449 transition count 674
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3278 place count 449 transition count 670
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3282 place count 445 transition count 670
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 3286 place count 445 transition count 670
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 3290 place count 445 transition count 670
Applied a total of 3290 rules in 866 ms. Remains 445 /2117 variables (removed 1672) and now considering 670/2435 (removed 1765) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 445/2117 places, 670/2435 transitions.
RANDOM walk for 40000 steps (392 resets) in 627 ms. (63 steps per ms) remains 3/4 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 268 ms. (148 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (26 resets) in 123 ms. (322 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (26 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
// Phase 1: matrix 670 rows 445 cols
[2024-05-26 04:19:01] [INFO ] Computed 55 invariants in 7 ms
[2024-05-26 04:19:01] [INFO ] State equation strengthened by 71 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 258/282 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 116/398 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 660/1058 variables, 398/453 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1058 variables, 61/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1058 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 57/1115 variables, 47/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 10/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1115 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1115 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1115/1115 variables, and 571 constraints, problems are : Problem set: 0 solved, 2 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 445/445 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 258/282 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 04:19:01] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-26 04:19:01] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-05-26 04:19:01] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 116/398 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 3 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 5/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 660/1058 variables, 398/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1058 variables, 61/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1058 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1058 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 57/1115 variables, 47/573 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1115 variables, 10/583 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1115 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 2 unsolved
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :1.61883e+11 after 3.62379e+14
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-26 04:19:02] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1115 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1115 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1115 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1115/1115 variables, and 587 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 445/445 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 14/14 constraints]
After SMT, in 1635ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 190 ms.
Support contains 22 out of 445 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 445/445 places, 670/670 transitions.
Graph (trivial) has 38 edges and 445 vertex of which 2 / 445 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 444 transition count 664
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 440 transition count 664
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 9 place count 440 transition count 659
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 19 place count 435 transition count 659
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 433 transition count 657
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 433 transition count 657
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 41 place count 424 transition count 648
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 416 transition count 633
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 416 transition count 633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 416 transition count 631
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 61 place count 414 transition count 627
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 414 transition count 627
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 414 transition count 625
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 73 place count 410 transition count 641
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 77 place count 406 transition count 631
Iterating global reduction 4 with 4 rules applied. Total rules applied 81 place count 406 transition count 631
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 82 place count 405 transition count 627
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 405 transition count 627
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 84 place count 404 transition count 625
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 404 transition count 625
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 91 place count 404 transition count 619
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 93 place count 404 transition count 619
Applied a total of 93 rules in 81 ms. Remains 404 /445 variables (removed 41) and now considering 619/670 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 404/445 places, 619/670 transitions.
RANDOM walk for 40000 steps (468 resets) in 278 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (31 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 676552 steps, run timeout after 3001 ms. (steps per millisecond=225 ) properties seen :0 out of 1
Probabilistic random walk after 676552 steps, saw 129018 distinct states, run finished after 3014 ms. (steps per millisecond=224 ) properties seen :0
// Phase 1: matrix 619 rows 404 cols
[2024-05-26 04:19:06] [INFO ] Computed 55 invariants in 4 ms
[2024-05-26 04:19:06] [INFO ] State equation strengthened by 69 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 236/258 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 99/357 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 609/966 variables, 357/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/966 variables, 59/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/966 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/1023 variables, 47/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1023 variables, 10/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1023 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1023 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1023/1023 variables, and 528 constraints, problems are : Problem set: 0 solved, 1 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 404/404 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 236/258 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-26 04:19:06] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-26 04:19:06] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-26 04:19:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/258 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 99/357 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:06] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 04:19:07] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 609/966 variables, 357/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/966 variables, 59/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 57/1023 variables, 47/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1023 variables, 10/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1023 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1023 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1023 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1023/1023 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 404/404 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 828ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 7153 steps, including 96 resets, run visited all 1 properties in 30 ms. (steps per millisecond=238 )
FORMULA NoC3x3-PT-3B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 33 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 15949 ms.

BK_STOP 1716697147464

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 itstools"
echo " Input is NoC3x3-PT-3B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-tall-171654352000598"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;