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.r171-tall-167838858700486.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is FlexibleBarrier-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r171-tall-167838858700486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 12:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 12:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 12:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 12:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 241K Mar 5 18:22 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 FlexibleBarrier-PT-08b-ReachabilityCardinality-00
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-01
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-02
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-03
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-04
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-05
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-06
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-07
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-08
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-09
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-08b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679476029028

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-22 09:07:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 09:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:07:10] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-22 09:07:10] [INFO ] Transformed 920 places.
[2023-03-22 09:07:10] [INFO ] Transformed 1057 transitions.
[2023-03-22 09:07:10] [INFO ] Found NUPN structural information;
[2023-03-22 09:07:10] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 159 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 14) seen :3
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :2
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1057 rows 920 cols
[2023-03-22 09:07:11] [INFO ] Computed 10 place invariants in 20 ms
[2023-03-22 09:07:12] [INFO ] After 467ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-22 09:07:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2023-03-22 09:07:13] [INFO ] After 668ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-22 09:07:13] [INFO ] Deduced a trap composed of 341 places in 262 ms of which 6 ms to minimize.
[2023-03-22 09:07:13] [INFO ] Deduced a trap composed of 316 places in 195 ms of which 1 ms to minimize.
[2023-03-22 09:07:14] [INFO ] Deduced a trap composed of 310 places in 197 ms of which 1 ms to minimize.
[2023-03-22 09:07:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 826 ms
[2023-03-22 09:07:14] [INFO ] Deduced a trap composed of 285 places in 194 ms of which 2 ms to minimize.
[2023-03-22 09:07:14] [INFO ] Deduced a trap composed of 277 places in 203 ms of which 1 ms to minimize.
[2023-03-22 09:07:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 512 ms
[2023-03-22 09:07:14] [INFO ] Deduced a trap composed of 279 places in 174 ms of which 1 ms to minimize.
[2023-03-22 09:07:15] [INFO ] Deduced a trap composed of 291 places in 171 ms of which 1 ms to minimize.
[2023-03-22 09:07:15] [INFO ] Deduced a trap composed of 284 places in 155 ms of which 1 ms to minimize.
[2023-03-22 09:07:15] [INFO ] Deduced a trap composed of 309 places in 146 ms of which 1 ms to minimize.
[2023-03-22 09:07:15] [INFO ] Deduced a trap composed of 291 places in 144 ms of which 1 ms to minimize.
[2023-03-22 09:07:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1014 ms
[2023-03-22 09:07:16] [INFO ] Deduced a trap composed of 161 places in 97 ms of which 1 ms to minimize.
[2023-03-22 09:07:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2023-03-22 09:07:16] [INFO ] After 3652ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 341 ms.
[2023-03-22 09:07:16] [INFO ] After 4430ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 50 ms.
Support contains 91 out of 920 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Graph (trivial) has 735 edges and 920 vertex of which 32 / 920 are part of one of the 5 SCC in 4 ms
Free SCC test removed 27 places
Drop transitions removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Drop transitions removed 190 transitions
Trivial Post-agglo rules discarded 190 transitions
Performed 190 trivial Post agglomeration. Transition count delta: 190
Iterating post reduction 0 with 190 rules applied. Total rules applied 191 place count 893 transition count 834
Reduce places removed 190 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 209 rules applied. Total rules applied 400 place count 703 transition count 815
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 419 place count 684 transition count 815
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 419 place count 684 transition count 780
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 489 place count 649 transition count 780
Discarding 261 places :
Symmetric choice reduction at 3 with 261 rule applications. Total rules 750 place count 388 transition count 519
Iterating global reduction 3 with 261 rules applied. Total rules applied 1011 place count 388 transition count 519
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 1011 place count 388 transition count 516
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1017 place count 385 transition count 516
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1043 place count 359 transition count 490
Iterating global reduction 3 with 26 rules applied. Total rules applied 1069 place count 359 transition count 490
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 1085 place count 359 transition count 474
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 1173 place count 315 transition count 430
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 1181 place count 315 transition count 422
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1184 place count 312 transition count 419
Iterating global reduction 5 with 3 rules applied. Total rules applied 1187 place count 312 transition count 419
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1193 place count 309 transition count 443
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1196 place count 309 transition count 440
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1198 place count 308 transition count 453
Free-agglomeration rule applied 111 times.
Iterating global reduction 5 with 111 rules applied. Total rules applied 1309 place count 308 transition count 342
Reduce places removed 111 places and 0 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 123 rules applied. Total rules applied 1432 place count 197 transition count 330
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 1442 place count 197 transition count 320
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1443 place count 197 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1444 place count 196 transition count 319
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1446 place count 196 transition count 319
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1447 place count 196 transition count 318
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1449 place count 196 transition count 318
Applied a total of 1449 rules in 241 ms. Remains 196 /920 variables (removed 724) and now considering 318/1057 (removed 739) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 196/920 places, 318/1057 transitions.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 6) seen :3
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 09:07:17] [INFO ] Flow matrix only has 312 transitions (discarded 6 similar events)
// Phase 1: matrix 312 rows 196 cols
[2023-03-22 09:07:17] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-22 09:07:17] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 09:07:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-22 09:07:17] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 09:07:17] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-22 09:07:17] [INFO ] After 74ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 09:07:17] [INFO ] Deduced a trap composed of 40 places in 74 ms of which 1 ms to minimize.
[2023-03-22 09:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-22 09:07:17] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2023-03-22 09:07:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-22 09:07:17] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2023-03-22 09:07:17] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2023-03-22 09:07:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-22 09:07:17] [INFO ] After 460ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-22 09:07:17] [INFO ] After 716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 9 ms.
Support contains 72 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 318/318 transitions.
Graph (trivial) has 42 edges and 196 vertex of which 2 / 196 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 195 transition count 307
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 186 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 185 transition count 306
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 25 place count 181 transition count 302
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 181 transition count 302
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 47 place count 172 transition count 293
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 50 place count 172 transition count 290
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 171 transition count 288
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 171 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 53 place count 171 transition count 287
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 69 place count 171 transition count 271
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 71 place count 169 transition count 269
Iterating global reduction 5 with 2 rules applied. Total rules applied 73 place count 169 transition count 269
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 75 place count 169 transition count 267
Free-agglomeration rule applied 14 times.
Iterating global reduction 6 with 14 rules applied. Total rules applied 89 place count 169 transition count 253
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 15 rules applied. Total rules applied 104 place count 155 transition count 252
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 109 place count 155 transition count 247
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 110 place count 155 transition count 247
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 111 place count 154 transition count 246
Applied a total of 111 rules in 48 ms. Remains 154 /196 variables (removed 42) and now considering 246/318 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 154/196 places, 246/318 transitions.
Incomplete random walk after 10000 steps, including 231 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1115158 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :{}
Probabilistic random walk after 1115158 steps, saw 209824 distinct states, run finished after 3003 ms. (steps per millisecond=371 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-22 09:07:21] [INFO ] Flow matrix only has 240 transitions (discarded 6 similar events)
// Phase 1: matrix 240 rows 154 cols
[2023-03-22 09:07:21] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-22 09:07:21] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 09:07:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 09:07:21] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 09:07:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 09:07:21] [INFO ] After 48ms SMT Verify possible using 36 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 09:07:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2023-03-22 09:07:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-22 09:07:21] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-22 09:07:21] [INFO ] After 392ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 72 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 246/246 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 246/246 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 154/154 places, 246/246 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 246/246 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2023-03-22 09:07:21] [INFO ] Flow matrix only has 240 transitions (discarded 6 similar events)
[2023-03-22 09:07:21] [INFO ] Invariant cache hit.
[2023-03-22 09:07:21] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-22 09:07:21] [INFO ] Flow matrix only has 240 transitions (discarded 6 similar events)
[2023-03-22 09:07:21] [INFO ] Invariant cache hit.
[2023-03-22 09:07:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-22 09:07:21] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-22 09:07:21] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 09:07:21] [INFO ] Flow matrix only has 240 transitions (discarded 6 similar events)
[2023-03-22 09:07:21] [INFO ] Invariant cache hit.
[2023-03-22 09:07:21] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 154/154 places, 246/246 transitions.
Graph (trivial) has 58 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions removed 18 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 147 transition count 219
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 140 transition count 214
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 27 place count 135 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 134 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 28 place count 134 transition count 210
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 32 place count 132 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 34 place count 130 transition count 206
Iterating global reduction 4 with 2 rules applied. Total rules applied 36 place count 130 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 130 transition count 205
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 47 place count 125 transition count 200
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 51 place count 123 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 52 place count 123 transition count 200
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 70 place count 123 transition count 182
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 74 place count 123 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 78 place count 119 transition count 178
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 79 place count 119 transition count 177
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 80 place count 119 transition count 177
Applied a total of 80 rules in 22 ms. Remains 119 /154 variables (removed 35) and now considering 177/246 (removed 69) transitions.
Running SMT prover for 3 properties.
[2023-03-22 09:07:21] [INFO ] Flow matrix only has 173 transitions (discarded 4 similar events)
// Phase 1: matrix 173 rows 119 cols
[2023-03-22 09:07:21] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-22 09:07:22] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 09:07:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-22 09:07:22] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 09:07:22] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-22 09:07:22] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-22 09:07:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-22 09:07:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 246 transitions and 888 arcs took 1 ms.
[2023-03-22 09:07:22] [INFO ] Flatten gal took : 41 ms
Total runtime 11956 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running FlexibleBarrier (PT), instance 08b
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 154 places, 246 transitions, 888 arcs.
Final Score: 3572.567
Took : 12 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: FlexibleBarrier-PT-08b-ReachabilityCardinality-06 (reachable & potential(( ( ( ( ( (tk(P134)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P134)) ) ) & ( ( (tk(P95)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P95)) ) ) ) & ( ( ( (tk(P132)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P132)) ) ) & ( ( (tk(P105)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P105)) ) ) ) ) & ( ( ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) | ( ( (tk(P102)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P102)) ) ) ) & ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) | ( ( ( (tk(P136)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P136)) ) ) | ( ( (tk(P70)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P70)) ) ) ) ) ) & ( ( ( ( (tk(P16)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P16)) ) ) | ( ( ( (tk(P69)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P69)) ) ) & ( ( (tk(P53)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P53)) ) ) ) ) & ( ( ( ( ( (tk(P9)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P9)) ) ) & ( ( ( (tk(P88)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P88)) ) ) & ( ( (tk(P82)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P82)) ) ) ) ) & ( ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) & ( ( ( (tk(P141)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P141)) ) ) & ( ( ( ( (tk(P97)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P97)) ) ) | ( ( ( (tk(P114)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P114)) ) ) | ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) ) ) | ( ( ( (tk(P74)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P74)) ) ) | ( ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) | ( ( ( (tk(P101)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P101)) ) ) & ( ( (tk(P22)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P22)) ) ) ) ) ) ) ) ) ) | ( ( ( (tk(P109)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P109)) ) ) & ( ( (tk(P83)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P83)) ) ) ) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-08b-ReachabilityCardinality-09 (reachable & potential(( ( ( (tk(P87)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P87)) ) ) & ( ( ( (tk(P130)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P130)) ) ) & ( ( ( ( (tk(P32)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P32)) ) ) & ( ( (tk(P20)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P20)) ) ) ) | ( ( ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) & ( ( (tk(P145)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P145)) ) ) ) | ( ( ( (tk(P3)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P3)) ) ) & ( ( (tk(P139)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P139)) ) ) ) ) ) ) )))
PROPERTY: FlexibleBarrier-PT-08b-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( ( (tk(P59)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P59)) ) ) | ( ( ( (tk(P137)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P137)) ) ) | ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) ) ) | ( ( ( ( (tk(P98)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P98)) ) ) & ( ( (tk(P99)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P99)) ) ) ) | ( ( ( ( (tk(P127)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P127)) ) ) & ( ( ( (tk(P50)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P50)) ) ) & ( ( ( (tk(P115)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P115)) ) ) | ( ( ( (tk(P71)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P71)) ) ) & ( ( (tk(P130)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P130)) ) ) ) ) ) ) | ( ( ( ( (tk(P5)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P5)) ) ) | ( ( (tk(P142)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P142)) ) ) ) & ( ( ( (tk(P89)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P89)) ) ) | ( ( (tk(P119)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P119)) ) ) ) ) ) ) ) & ( ( ( ( (tk(P91)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P91)) ) ) | ( ( ( (tk(P24)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P24)) ) ) | ( ( (tk(P146)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P146)) ) ) ) ) | ( ( ( ( (tk(P122)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P122)) ) ) | ( ( (tk(P124)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P124)) ) ) ) | ( ( ( (tk(P74)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P74)) ) ) | ( ( ( ( (tk(P116)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P116)) ) ) | ( ( ( (tk(P86)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P86)) ) ) | ( ( (tk(P80)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P80)) ) ) ) ) & ( ( ( ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) | ( ( (tk(P75)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P75)) ) ) ) | ( ( ( (tk(P150)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P150)) ) ) | ( ( (tk(P85)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P85)) ) ) ) ) & ( ( ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) | ( ( (tk(P72)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P72)) ) ) ) | ( ( ( (tk(P148)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P148)) ) ) | ( ( ( (tk(P103)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P103)) ) ) & ( ( ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) | ( ( (tk(P144)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P144)) ) ) ) | ( ( ( (tk(P131)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P131)) ) ) | ( ( ( (tk(P147)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P147)) ) ) | ( ( ( ( (tk(P34)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P34)) ) ) & ( ( (tk(P152)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P152)) ) ) ) & ( ( ( (tk(P60)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P60)) ) ) & ( ( ( (tk(P128)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P128)) ) ) | ( ( (tk(P49)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P49)) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )))
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA FlexibleBarrier-PT-08b-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1679476114032

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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="FlexibleBarrier-PT-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r171-tall-167838858700486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-08b.tgz
mv FlexibleBarrier-PT-08b 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 ;