Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716900302.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716900302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 512K Mar 5 18:23 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 ShieldIIPt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679438663180

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:44:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 22:44:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:44:27] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2023-03-21 22:44:27] [INFO ] Transformed 2103 places.
[2023-03-21 22:44:27] [INFO ] Transformed 1953 transitions.
[2023-03-21 22:44:27] [INFO ] Found NUPN structural information;
[2023-03-21 22:44:27] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 315 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 15) seen :10
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1953 rows 2103 cols
[2023-03-21 22:44:28] [INFO ] Computed 271 place invariants in 109 ms
[2023-03-21 22:44:29] [INFO ] After 1034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:44:30] [INFO ] [Nat]Absence check using 271 positive place invariants in 105 ms returned sat
[2023-03-21 22:44:33] [INFO ] After 3701ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:44:34] [INFO ] Deduced a trap composed of 21 places in 929 ms of which 11 ms to minimize.
[2023-03-21 22:44:36] [INFO ] Deduced a trap composed of 18 places in 1199 ms of which 2 ms to minimize.
[2023-03-21 22:44:37] [INFO ] Deduced a trap composed of 19 places in 634 ms of which 2 ms to minimize.
[2023-03-21 22:44:37] [INFO ] Deduced a trap composed of 28 places in 763 ms of which 17 ms to minimize.
[2023-03-21 22:44:38] [INFO ] Deduced a trap composed of 18 places in 782 ms of which 2 ms to minimize.
[2023-03-21 22:44:39] [INFO ] Deduced a trap composed of 31 places in 924 ms of which 1 ms to minimize.
[2023-03-21 22:44:40] [INFO ] Deduced a trap composed of 45 places in 719 ms of which 2 ms to minimize.
[2023-03-21 22:44:41] [INFO ] Deduced a trap composed of 37 places in 863 ms of which 1 ms to minimize.
[2023-03-21 22:44:42] [INFO ] Deduced a trap composed of 28 places in 693 ms of which 2 ms to minimize.
[2023-03-21 22:44:43] [INFO ] Deduced a trap composed of 28 places in 645 ms of which 1 ms to minimize.
[2023-03-21 22:44:43] [INFO ] Deduced a trap composed of 29 places in 771 ms of which 3 ms to minimize.
[2023-03-21 22:44:44] [INFO ] Deduced a trap composed of 19 places in 710 ms of which 1 ms to minimize.
[2023-03-21 22:44:45] [INFO ] Deduced a trap composed of 50 places in 748 ms of which 2 ms to minimize.
[2023-03-21 22:44:46] [INFO ] Deduced a trap composed of 27 places in 607 ms of which 1 ms to minimize.
[2023-03-21 22:44:47] [INFO ] Deduced a trap composed of 28 places in 698 ms of which 1 ms to minimize.
[2023-03-21 22:44:47] [INFO ] Deduced a trap composed of 22 places in 761 ms of which 3 ms to minimize.
[2023-03-21 22:44:48] [INFO ] Deduced a trap composed of 35 places in 665 ms of which 5 ms to minimize.
[2023-03-21 22:44:49] [INFO ] Deduced a trap composed of 26 places in 631 ms of which 3 ms to minimize.
[2023-03-21 22:44:50] [INFO ] Deduced a trap composed of 26 places in 527 ms of which 1 ms to minimize.
[2023-03-21 22:44:50] [INFO ] Deduced a trap composed of 26 places in 573 ms of which 2 ms to minimize.
[2023-03-21 22:44:51] [INFO ] Deduced a trap composed of 38 places in 839 ms of which 2 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Deduced a trap composed of 22 places in 647 ms of which 5 ms to minimize.
[2023-03-21 22:44:52] [INFO ] Deduced a trap composed of 45 places in 524 ms of which 3 ms to minimize.
[2023-03-21 22:44:53] [INFO ] Deduced a trap composed of 22 places in 585 ms of which 1 ms to minimize.
[2023-03-21 22:44:54] [INFO ] Deduced a trap composed of 33 places in 577 ms of which 1 ms to minimize.
[2023-03-21 22:44:54] [INFO ] Trap strengthening (SAT) tested/added 25/25 trap constraints in 20324 ms
[2023-03-21 22:44:54] [INFO ] After 24053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-21 22:44:54] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 412 ms.
Support contains 113 out of 2103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 2103 transition count 1516
Reduce places removed 437 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 439 rules applied. Total rules applied 876 place count 1666 transition count 1514
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 30 rules applied. Total rules applied 906 place count 1665 transition count 1485
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 935 place count 1636 transition count 1485
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 125 Pre rules applied. Total rules applied 935 place count 1636 transition count 1360
Deduced a syphon composed of 125 places in 4 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 1185 place count 1511 transition count 1360
Discarding 188 places :
Symmetric choice reduction at 4 with 188 rule applications. Total rules 1373 place count 1323 transition count 1172
Iterating global reduction 4 with 188 rules applied. Total rules applied 1561 place count 1323 transition count 1172
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 1561 place count 1323 transition count 1098
Deduced a syphon composed of 74 places in 5 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 1709 place count 1249 transition count 1098
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 2 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 4 with 900 rules applied. Total rules applied 2609 place count 799 transition count 648
Renaming transitions due to excessive name length > 1024 char.
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2763 place count 722 transition count 688
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2765 place count 722 transition count 686
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2767 place count 720 transition count 686
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 5 with 26 rules applied. Total rules applied 2793 place count 720 transition count 686
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2794 place count 719 transition count 685
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2796 place count 717 transition count 685
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2796 place count 717 transition count 684
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2798 place count 716 transition count 684
Applied a total of 2798 rules in 685 ms. Remains 716 /2103 variables (removed 1387) and now considering 684/1953 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 686 ms. Remains : 716/2103 places, 684/1953 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 102524 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102524 steps, saw 59150 distinct states, run finished after 3004 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 684 rows 716 cols
[2023-03-21 22:44:59] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-21 22:44:59] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:44:59] [INFO ] [Nat]Absence check using 269 positive place invariants in 65 ms returned sat
[2023-03-21 22:45:00] [INFO ] After 699ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:00] [INFO ] State equation strengthened by 107 read => feed constraints.
[2023-03-21 22:45:00] [INFO ] After 542ms SMT Verify possible using 107 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:01] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 1 ms to minimize.
[2023-03-21 22:45:01] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2023-03-21 22:45:01] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 1 ms to minimize.
[2023-03-21 22:45:01] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-03-21 22:45:02] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-21 22:45:02] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 1 ms to minimize.
[2023-03-21 22:45:02] [INFO ] Deduced a trap composed of 6 places in 181 ms of which 1 ms to minimize.
[2023-03-21 22:45:02] [INFO ] Deduced a trap composed of 8 places in 137 ms of which 0 ms to minimize.
[2023-03-21 22:45:03] [INFO ] Deduced a trap composed of 6 places in 259 ms of which 8 ms to minimize.
[2023-03-21 22:45:03] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
[2023-03-21 22:45:03] [INFO ] Deduced a trap composed of 7 places in 205 ms of which 0 ms to minimize.
[2023-03-21 22:45:03] [INFO ] Deduced a trap composed of 7 places in 291 ms of which 1 ms to minimize.
[2023-03-21 22:45:04] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-21 22:45:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3159 ms
[2023-03-21 22:45:04] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-03-21 22:45:04] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 0 ms to minimize.
[2023-03-21 22:45:04] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 1 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 1 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1111 ms
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 0 ms to minimize.
[2023-03-21 22:45:05] [INFO ] Deduced a trap composed of 3 places in 188 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 21 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Deduced a trap composed of 6 places in 193 ms of which 0 ms to minimize.
[2023-03-21 22:45:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1101 ms
[2023-03-21 22:45:06] [INFO ] After 6387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 565 ms.
[2023-03-21 22:45:07] [INFO ] After 8038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 128 ms.
Support contains 113 out of 716 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 44 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 716/716 places, 684/684 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 716/716 places, 684/684 transitions.
Applied a total of 0 rules in 21 ms. Remains 716 /716 variables (removed 0) and now considering 684/684 (removed 0) transitions.
[2023-03-21 22:45:07] [INFO ] Invariant cache hit.
[2023-03-21 22:45:08] [INFO ] Implicit Places using invariants in 562 ms returned [702]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 564 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 715/716 places, 684/684 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 714 transition count 683
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 714 transition count 683
Applied a total of 2 rules in 38 ms. Remains 714 /715 variables (removed 1) and now considering 683/684 (removed 1) transitions.
// Phase 1: matrix 683 rows 714 cols
[2023-03-21 22:45:08] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:45:08] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-21 22:45:08] [INFO ] Invariant cache hit.
[2023-03-21 22:45:09] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-21 22:45:10] [INFO ] Implicit Places using invariants and state equation in 1311 ms returned []
Implicit Place search using SMT with State Equation took 1913 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 714/716 places, 683/684 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2539 ms. Remains : 714/716 places, 683/684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 289 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 120005 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 120005 steps, saw 69390 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-21 22:45:13] [INFO ] Invariant cache hit.
[2023-03-21 22:45:13] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:45:14] [INFO ] [Nat]Absence check using 268 positive place invariants in 48 ms returned sat
[2023-03-21 22:45:14] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:14] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-21 22:45:15] [INFO ] After 469ms SMT Verify possible using 106 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 5 places in 313 ms of which 1 ms to minimize.
[2023-03-21 22:45:15] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 7 places in 452 ms of which 1 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 6 places in 205 ms of which 1 ms to minimize.
[2023-03-21 22:45:16] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 6 places in 113 ms of which 0 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 1 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Deduced a trap composed of 7 places in 221 ms of which 1 ms to minimize.
[2023-03-21 22:45:17] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2317 ms
[2023-03-21 22:45:18] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 0 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2023-03-21 22:45:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 937 ms
[2023-03-21 22:45:19] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 1 ms to minimize.
[2023-03-21 22:45:19] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 13 ms to minimize.
[2023-03-21 22:45:19] [INFO ] Deduced a trap composed of 7 places in 162 ms of which 0 ms to minimize.
[2023-03-21 22:45:19] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 27 ms to minimize.
[2023-03-21 22:45:20] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2023-03-21 22:45:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1181 ms
[2023-03-21 22:45:20] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-21 22:45:20] [INFO ] Deduced a trap composed of 9 places in 281 ms of which 24 ms to minimize.
[2023-03-21 22:45:21] [INFO ] Deduced a trap composed of 5 places in 210 ms of which 1 ms to minimize.
[2023-03-21 22:45:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 788 ms
[2023-03-21 22:45:21] [INFO ] After 6268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-21 22:45:21] [INFO ] After 7918ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 146 ms.
Support contains 113 out of 714 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 15 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 714/714 places, 683/683 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 714/714 places, 683/683 transitions.
Applied a total of 0 rules in 38 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
[2023-03-21 22:45:21] [INFO ] Invariant cache hit.
[2023-03-21 22:45:22] [INFO ] Implicit Places using invariants in 957 ms returned []
[2023-03-21 22:45:22] [INFO ] Invariant cache hit.
[2023-03-21 22:45:23] [INFO ] State equation strengthened by 106 read => feed constraints.
[2023-03-21 22:45:24] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned []
Implicit Place search using SMT with State Equation took 2668 ms to find 0 implicit places.
[2023-03-21 22:45:24] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-21 22:45:24] [INFO ] Invariant cache hit.
[2023-03-21 22:45:25] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3415 ms. Remains : 714/714 places, 683/683 transitions.
Partial Free-agglomeration rule applied 73 times.
Drop transitions removed 73 transitions
Iterating global reduction 0 with 73 rules applied. Total rules applied 73 place count 714 transition count 683
Applied a total of 73 rules in 26 ms. Remains 714 /714 variables (removed 0) and now considering 683/683 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 683 rows 714 cols
[2023-03-21 22:45:25] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:45:25] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-21 22:45:25] [INFO ] [Nat]Absence check using 268 positive place invariants in 67 ms returned sat
[2023-03-21 22:45:26] [INFO ] After 893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-21 22:45:27] [INFO ] After 443ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:27] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-21 22:45:27] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 1 ms to minimize.
[2023-03-21 22:45:27] [INFO ] Deduced a trap composed of 6 places in 202 ms of which 0 ms to minimize.
[2023-03-21 22:45:28] [INFO ] Deduced a trap composed of 3 places in 317 ms of which 0 ms to minimize.
[2023-03-21 22:45:28] [INFO ] Deduced a trap composed of 5 places in 142 ms of which 0 ms to minimize.
[2023-03-21 22:45:28] [INFO ] Deduced a trap composed of 7 places in 545 ms of which 29 ms to minimize.
[2023-03-21 22:45:29] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 1 ms to minimize.
[2023-03-21 22:45:29] [INFO ] Deduced a trap composed of 5 places in 458 ms of which 1 ms to minimize.
[2023-03-21 22:45:29] [INFO ] Deduced a trap composed of 6 places in 290 ms of which 1 ms to minimize.
[2023-03-21 22:45:30] [INFO ] Deduced a trap composed of 8 places in 251 ms of which 1 ms to minimize.
[2023-03-21 22:45:30] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 0 ms to minimize.
[2023-03-21 22:45:30] [INFO ] Deduced a trap composed of 8 places in 321 ms of which 1 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 10 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 0 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2023-03-21 22:45:31] [INFO ] Deduced a trap composed of 6 places in 136 ms of which 1 ms to minimize.
[2023-03-21 22:45:32] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-21 22:45:32] [INFO ] Deduced a trap composed of 9 places in 155 ms of which 0 ms to minimize.
[2023-03-21 22:45:32] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5222 ms
[2023-03-21 22:45:32] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2023-03-21 22:45:33] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 1 ms to minimize.
[2023-03-21 22:45:33] [INFO ] Deduced a trap composed of 6 places in 173 ms of which 0 ms to minimize.
[2023-03-21 22:45:33] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2023-03-21 22:45:33] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2023-03-21 22:45:34] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 1 ms to minimize.
[2023-03-21 22:45:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1552 ms
[2023-03-21 22:45:34] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2023-03-21 22:45:34] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-21 22:45:34] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2023-03-21 22:45:35] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 1 ms to minimize.
[2023-03-21 22:45:35] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-21 22:45:35] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 1 ms to minimize.
[2023-03-21 22:45:35] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 0 ms to minimize.
[2023-03-21 22:45:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1389 ms
[2023-03-21 22:45:35] [INFO ] After 9135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 446 ms.
[2023-03-21 22:45:36] [INFO ] After 10831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-21 22:45:36] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 21 ms.
[2023-03-21 22:45:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 714 places, 683 transitions and 2947 arcs took 10 ms.
[2023-03-21 22:45:36] [INFO ] Flatten gal took : 93 ms
Total runtime 69979 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/826/inv_0_ --invariant=/tmp/826/inv_1_ --invariant=/tmp/826/inv_2_ --invariant=/tmp/826/inv_3_ --invariant=/tmp/826/inv_4_ --inv-par
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldIIPt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679438772419

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023
rfs formula name ShieldIIPt-PT-030B-ReachabilityCardinality-00
rfs formula type AG
rfs formula formula --invariant=/tmp/826/inv_0_
rfs formula name ShieldIIPt-PT-030B-ReachabilityCardinality-02
rfs formula type EF
rfs formula formula --invariant=/tmp/826/inv_1_
rfs formula name ShieldIIPt-PT-030B-ReachabilityCardinality-07
rfs formula type EF
rfs formula formula --invariant=/tmp/826/inv_2_
rfs formula name ShieldIIPt-PT-030B-ReachabilityCardinality-11
rfs formula type EF
rfs formula formula --invariant=/tmp/826/inv_3_
rfs formula name ShieldIIPt-PT-030B-ReachabilityCardinality-12
rfs formula type AG
rfs formula formula --invariant=/tmp/826/inv_4_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 714 places, 683 transitions and 2947 arcs
pnml2lts-sym: Petri net ShieldIIPt_PT_030B analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 683->461 groups
pnml2lts-sym: Regrouping took 0.150 real 0.160 user 0.000 sys
pnml2lts-sym: state vector length is 714; there are 461 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/826/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/826/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/826/inv_3_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/826/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/826/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: all invariants violated
pnml2lts-sym: exiting now
pnml2lts-sym: invariant detection took 33.040 real 131.870 user 0.190 sys
pnml2lts-sym: max token count: 1

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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-030B, 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 r393-oct2-167903716900302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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