Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445000014.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PhilosophersDyn-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.8K Apr 11 14:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 11 14:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 14:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 14:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-10-ReachabilityCardinality-2024-00
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-01
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-02
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-03
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-04
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-05
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-06
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-07
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-08
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-09
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-10
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-11
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-12
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-13
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-14
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716840662751

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:04] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 20:11:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 630 ms
[2024-05-27 20:11:05] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 33 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 20:11:05] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2024-05-27 20:11:05] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40011 steps (2797 resets) in 1961 ms. (20 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (140 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (400 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (58 resets) in 102 ms. (38 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (253 resets) in 93 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (145 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (135 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (202 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (300 resets) in 120 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (186 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4000 steps (400 resets) in 55 ms. (71 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (141 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (132 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (201 resets) in 155 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (55 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
Probably explored full state space saw : 504 states, properties seen :0
Probabilistic random walk after 1609 steps, saw 504 distinct states, run finished after 46 ms. (steps per millisecond=34 ) properties seen :0
Explored full state space saw : 504 states, properties seen :0
Exhaustive walk after 1609 steps, saw 504 distinct states, run finished after 37 ms. (steps per millisecond=43 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 14 ms
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-07 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:06] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 63 ms.
[2024-05-27 20:11:06] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
RANDOM walk for 40000 steps (4753 resets) in 1787 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (339 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 319016 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 1
Probabilistic random walk after 319016 steps, saw 80444 distinct states, run finished after 3005 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-27 20:11:09] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2024-05-27 20:11:10] [INFO ] Computed 39 invariants in 89 ms
[2024-05-27 20:11:10] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/135 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/160 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1905/2065 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2065 variables, 1030/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2075 variables, 10/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2075/2075 variables, and 1239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1625 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/135 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/160 variables, 9/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1905/2065 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2065 variables, 1030/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2075 variables, 10/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2075 variables, 0/1239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 1239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1326 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 170/170 constraints, ReadFeed: 1030/1030 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 3243ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 242 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 308 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
Running 2220 sub problems to find dead transitions.
[2024-05-27 20:11:13] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2024-05-27 20:11:13] [INFO ] Invariant cache hit.
[2024-05-27 20:11:13] [INFO ] State equation strengthened by 1030 read => feed constraints.
Problem TDEAD100 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD640 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD681 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD711 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD744 is UNSAT
Problem TDEAD752 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD792 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD883 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD911 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD933 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD944 is UNSAT
Problem TDEAD954 is UNSAT
Problem TDEAD964 is UNSAT
Problem TDEAD974 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1011 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1133 is UNSAT
Problem TDEAD1144 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1344 is UNSAT
Problem TDEAD1400 is UNSAT
Problem TDEAD1411 is UNSAT
Problem TDEAD1422 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1444 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1550 is UNSAT
Problem TDEAD1560 is UNSAT
Problem TDEAD1570 is UNSAT
Problem TDEAD1580 is UNSAT
Problem TDEAD1590 is UNSAT
Problem TDEAD1600 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1620 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1630 is UNSAT
Problem TDEAD1633 is UNSAT
Problem TDEAD1640 is UNSAT
Problem TDEAD1644 is UNSAT
Problem TDEAD1651 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1671 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1711 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1733 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1782 is UNSAT
Problem TDEAD1792 is UNSAT
Problem TDEAD1800 is UNSAT
Problem TDEAD1802 is UNSAT
Problem TDEAD1811 is UNSAT
Problem TDEAD1812 is UNSAT
Problem TDEAD1822 is UNSAT
Problem TDEAD1832 is UNSAT
Problem TDEAD1833 is UNSAT
Problem TDEAD1842 is UNSAT
Problem TDEAD1844 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2044 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 30/30 constraints. Problems are: Problem set: 190 solved, 2030 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD645 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD745 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD945 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD967 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1145 is UNSAT
Problem TDEAD1146 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1345 is UNSAT
Problem TDEAD1348 is UNSAT
Problem TDEAD1356 is UNSAT
Problem TDEAD1358 is UNSAT
Problem TDEAD1367 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1378 is UNSAT
Problem TDEAD1388 is UNSAT
Problem TDEAD1389 is UNSAT
Problem TDEAD1398 is UNSAT
Problem TDEAD1408 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1438 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1459 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1469 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1479 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1499 is UNSAT
Problem TDEAD1509 is UNSAT
Problem TDEAD1519 is UNSAT
Problem TDEAD1529 is UNSAT
Problem TDEAD1539 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1556 is UNSAT
Problem TDEAD1567 is UNSAT
Problem TDEAD1578 is UNSAT
Problem TDEAD1589 is UNSAT
Problem TDEAD1645 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1678 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1767 is UNSAT
Problem TDEAD1778 is UNSAT
Problem TDEAD1789 is UNSAT
Problem TDEAD1845 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1989 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 9/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1905/2075 variables, 170/209 constraints. Problems are: Problem set: 380 solved, 1840 unsolved
SMT process timed out in 36458ms, After SMT, problems are : Problem set: 380 solved, 1840 unsolved
Search for dead transitions found 380 dead transitions in 36512ms
Found 380 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 126 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36980 ms. Remains : 170/170 places, 1885/2265 transitions.
RANDOM walk for 40000 steps (4785 resets) in 576 ms. (69 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (339 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 393807 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :0 out of 1
Probabilistic random walk after 393807 steps, saw 98438 distinct states, run finished after 3002 ms. (steps per millisecond=131 ) properties seen :0
// Phase 1: matrix 1885 rows 170 cols
[2024-05-27 20:11:53] [INFO ] Computed 39 invariants in 59 ms
[2024-05-27 20:11:53] [INFO ] State equation strengthened by 1010 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2045 variables, 1010/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2045 variables, 0/1209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/2055 variables, 10/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2055 variables, 0/1219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2055/2055 variables, and 1219 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2579 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 170/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 113/160 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1885/2045 variables, 160/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2045/2055 variables, and 1209 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5477 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 160/170 constraints, ReadFeed: 1010/1010 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 8172ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 20 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 126 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 110 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2024-05-27 20:12:02] [INFO ] Invariant cache hit.
[2024-05-27 20:12:02] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-27 20:12:02] [INFO ] Invariant cache hit.
[2024-05-27 20:12:03] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-05-27 20:12:31] [INFO ] Implicit Places using invariants and state equation in 29130 ms returned []
Implicit Place search using SMT with State Equation took 29532 ms to find 0 implicit places.
[2024-05-27 20:12:31] [INFO ] Redundant transitions in 154 ms returned []
Running 1840 sub problems to find dead transitions.
[2024-05-27 20:12:31] [INFO ] Invariant cache hit.
[2024-05-27 20:12:31] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
At refinement iteration 3 (OVERLAPS) 1885/2055 variables, 170/209 constraints. Problems are: Problem set: 0 solved, 1840 unsolved
SMT process timed out in 42598ms, After SMT, problems are : Problem set: 0 solved, 1840 unsolved
Search for dead transitions found 0 dead transitions in 42615ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72423 ms. Remains : 170/170 places, 1885/1885 transitions.
Attempting over-approximation, by ignoring read arcs.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 2685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 160 transition count 2685
Applied a total of 20 rules in 208 ms. Remains 160 /170 variables (removed 10) and now considering 2685/1885 (removed -800) transitions.
Running SMT prover for 1 properties.
[2024-05-27 20:13:14] [INFO ] Flow matrix only has 2595 transitions (discarded 90 similar events)
// Phase 1: matrix 2595 rows 160 cols
[2024-05-27 20:13:14] [INFO ] Computed 39 invariants in 72 ms
[2024-05-27 20:13:14] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:13:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-27 20:13:14] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 13 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-27 20:13:15] [INFO ] After 603ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :1
[2024-05-27 20:13:15] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1071 ms.
[2024-05-27 20:13:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-27 20:13:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 31 ms.
[2024-05-27 20:13:15] [INFO ] Flatten gal took : 305 ms
Total runtime 131699 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 170
TRANSITIONS: 1885
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.109s, Sys 0.009s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 606
MODEL NAME: /home/mcc/execution/418/model
170 places, 1885 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716841414701

--------------------
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 ReachabilityCardinality -timeout 360 -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="PhilosophersDyn-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PhilosophersDyn-COL-10, 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 r289-tajo-171654445000014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-10.tgz
mv PhilosophersDyn-COL-10 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 ;