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.r103-tall-167814478100291.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 lolaxred
Input is DBSingleClientW-PT-d2m04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478100291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 15:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m04-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d2m04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678244657036

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 03:04:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 03:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:04:18] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2023-03-08 03:04:18] [INFO ] Transformed 4763 places.
[2023-03-08 03:04:18] [INFO ] Transformed 2478 transitions.
[2023-03-08 03:04:18] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 633 place count 749 transition count 1235
Iterating global reduction 1 with 388 rules applied. Total rules applied 1021 place count 749 transition count 1235
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1039 place count 749 transition count 1217
Discarding 311 places :
Symmetric choice reduction at 2 with 311 rule applications. Total rules 1350 place count 438 transition count 906
Iterating global reduction 2 with 311 rules applied. Total rules applied 1661 place count 438 transition count 906
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1672 place count 438 transition count 895
Discarding 234 places :
Symmetric choice reduction at 3 with 234 rule applications. Total rules 1906 place count 204 transition count 565
Iterating global reduction 3 with 234 rules applied. Total rules applied 2140 place count 204 transition count 565
Ensure Unique test removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Iterating post reduction 3 with 207 rules applied. Total rules applied 2347 place count 204 transition count 358
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2370 place count 181 transition count 315
Iterating global reduction 4 with 23 rules applied. Total rules applied 2393 place count 181 transition count 315
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 2403 place count 181 transition count 305
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 2417 place count 167 transition count 291
Iterating global reduction 5 with 14 rules applied. Total rules applied 2431 place count 167 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2434 place count 167 transition count 288
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2446 place count 155 transition count 276
Iterating global reduction 6 with 12 rules applied. Total rules applied 2458 place count 155 transition count 276
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2469 place count 155 transition count 265
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2473 place count 151 transition count 248
Iterating global reduction 7 with 4 rules applied. Total rules applied 2477 place count 151 transition count 248
Applied a total of 2477 rules in 187 ms. Remains 151 /1183 variables (removed 1032) and now considering 248/2478 (removed 2230) transitions.
// Phase 1: matrix 248 rows 151 cols
[2023-03-08 03:04:19] [INFO ] Computed 2 place invariants in 19 ms
[2023-03-08 03:04:19] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-08 03:04:19] [INFO ] Invariant cache hit.
[2023-03-08 03:04:19] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-08 03:04:20] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 876 ms to find 0 implicit places.
[2023-03-08 03:04:20] [INFO ] Invariant cache hit.
[2023-03-08 03:04:20] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/1183 places, 248/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 151/1183 places, 248/2478 transitions.
Support contains 9 out of 151 places after structural reductions.
[2023-03-08 03:04:20] [INFO ] Flatten gal took : 42 ms
[2023-03-08 03:04:20] [INFO ] Flatten gal took : 21 ms
[2023-03-08 03:04:20] [INFO ] Input system was already deterministic with 248 transitions.
Incomplete random walk after 10000 steps, including 2288 resets, run finished after 342 ms. (steps per millisecond=29 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 984 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 992 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 996 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 03:04:21] [INFO ] Invariant cache hit.
[2023-03-08 03:04:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 03:04:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:04:21] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 03:04:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 03:04:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:04:21] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2023-03-08 03:04:21] [INFO ] State equation strengthened by 103 read => feed constraints.
[2023-03-08 03:04:21] [INFO ] After 87ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-08 03:04:21] [INFO ] After 174ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-08 03:04:21] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 248/248 transitions.
Graph (complete) has 528 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 150 transition count 244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 146 transition count 240
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 146 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 146 transition count 238
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 143 transition count 231
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 143 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 143 transition count 230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 142 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 142 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 142 transition count 227
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 26 place count 141 transition count 220
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 141 transition count 220
Applied a total of 27 rules in 41 ms. Remains 141 /151 variables (removed 10) and now considering 220/248 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 141/151 places, 220/248 transitions.
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 983 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 955 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 220 rows 141 cols
[2023-03-08 03:04:22] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 03:04:22] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 03:04:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 03:04:22] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 03:04:22] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-08 03:04:22] [INFO ] After 51ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 03:04:22] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-08 03:04:22] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 141 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 141/141 places, 220/220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 140 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 140 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 139 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 139 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 138 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 137 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 137 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 137 transition count 211
Applied a total of 9 rules in 29 ms. Remains 137 /141 variables (removed 4) and now considering 211/220 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 137/141 places, 211/220 transitions.
Incomplete random walk after 10000 steps, including 2335 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 997 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 953 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Finished probabilistic random walk after 36761 steps, run visited all 3 properties in 248 ms. (steps per millisecond=148 )
Probabilistic random walk after 36761 steps, saw 15798 distinct states, run finished after 248 ms. (steps per millisecond=148 ) properties seen :3
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 21 stable transitions
Graph (complete) has 567 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 248/248 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 146 transition count 234
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 146 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 146 transition count 232
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 142 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 142 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 142 transition count 219
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 139 transition count 215
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 139 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 139 transition count 214
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 31 place count 136 transition count 210
Iterating global reduction 3 with 3 rules applied. Total rules applied 34 place count 136 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 136 transition count 208
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 135 transition count 207
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 135 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 39 place count 135 transition count 206
Applied a total of 39 rules in 14 ms. Remains 135 /151 variables (removed 16) and now considering 206/248 (removed 42) transitions.
// Phase 1: matrix 206 rows 135 cols
[2023-03-08 03:04:23] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:04:23] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 03:04:23] [INFO ] Invariant cache hit.
[2023-03-08 03:04:23] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 03:04:23] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-08 03:04:23] [INFO ] Invariant cache hit.
[2023-03-08 03:04:23] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/151 places, 206/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 135/151 places, 206/248 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s119 s95), p1:(GT s72 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29821 reset in 318 ms.
Product exploration explored 100000 steps with 29749 reset in 241 ms.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 496 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 290 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 6574 steps, including 1520 resets, run visited all 3 properties in 125 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 324 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 135 /135 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-08 03:04:25] [INFO ] Invariant cache hit.
[2023-03-08 03:04:25] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 03:04:25] [INFO ] Invariant cache hit.
[2023-03-08 03:04:25] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 03:04:26] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-08 03:04:26] [INFO ] Invariant cache hit.
[2023-03-08 03:04:26] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 135/135 places, 206/206 transitions.
Computed a total of 5 stabilizing places and 18 stable transitions
Graph (complete) has 496 edges and 135 vertex of which 134 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 305 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Finished random walk after 2131 steps, including 477 resets, run visited all 3 properties in 44 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 7 factoid took 368 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 29789 reset in 205 ms.
Product exploration explored 100000 steps with 29762 reset in 191 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 206/206 transitions.
Applied a total of 0 rules in 13 ms. Remains 135 /135 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-08 03:04:28] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 03:04:28] [INFO ] Invariant cache hit.
[2023-03-08 03:04:28] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 135/135 places, 206/206 transitions.
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2023-03-08 03:04:28] [INFO ] Invariant cache hit.
[2023-03-08 03:04:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 03:04:28] [INFO ] Invariant cache hit.
[2023-03-08 03:04:28] [INFO ] State equation strengthened by 79 read => feed constraints.
[2023-03-08 03:04:28] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2023-03-08 03:04:28] [INFO ] Invariant cache hit.
[2023-03-08 03:04:28] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 482 ms. Remains : 135/135 places, 206/206 transitions.
Treatment of property DBSingleClientW-PT-d2m04-LTLCardinality-08 finished in 5736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 248/248 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 234
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 234
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 143 transition count 231
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 136 transition count 210
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 136 transition count 210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 136 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 132 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 132 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 132 transition count 194
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 48 place count 129 transition count 184
Iterating global reduction 3 with 3 rules applied. Total rules applied 51 place count 129 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 129 transition count 181
Applied a total of 54 rules in 9 ms. Remains 129 /151 variables (removed 22) and now considering 181/248 (removed 67) transitions.
// Phase 1: matrix 181 rows 129 cols
[2023-03-08 03:04:28] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:04:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 03:04:28] [INFO ] Invariant cache hit.
[2023-03-08 03:04:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 03:04:29] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-08 03:04:29] [INFO ] Invariant cache hit.
[2023-03-08 03:04:29] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/151 places, 181/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 129/151 places, 181/248 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s123 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLCardinality-10 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 248/248 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 143 transition count 231
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 143 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 143 transition count 228
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 26 place count 136 transition count 211
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 136 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 36 place count 136 transition count 208
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 40 place count 132 transition count 195
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 132 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 132 transition count 193
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 49 place count 129 transition count 183
Iterating global reduction 3 with 3 rules applied. Total rules applied 52 place count 129 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 128 transition count 181
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 128 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 128 transition count 180
Applied a total of 56 rules in 16 ms. Remains 128 /151 variables (removed 23) and now considering 180/248 (removed 68) transitions.
// Phase 1: matrix 180 rows 128 cols
[2023-03-08 03:04:29] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:04:29] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 03:04:29] [INFO ] Invariant cache hit.
[2023-03-08 03:04:29] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-08 03:04:29] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 03:04:29] [INFO ] Invariant cache hit.
[2023-03-08 03:04:29] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/151 places, 180/248 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 128/151 places, 180/248 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLCardinality-13 finished in 513 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0))))))'
[2023-03-08 03:04:29] [INFO ] Flatten gal took : 14 ms
[2023-03-08 03:04:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 03:04:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 151 places, 248 transitions and 976 arcs took 4 ms.
Total runtime 11487 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d2m04
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA DBSingleClientW-PT-d2m04-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678244671044

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DBSingleClientW-PT-d2m04-LTLCardinality-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DBSingleClientW-PT-d2m04-LTLCardinality-08
lola: result : false
lola: markings : 6220
lola: fired transitions : 10640
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d2m04-LTLCardinality-08: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 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="DBSingleClientW-PT-d2m04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DBSingleClientW-PT-d2m04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478100291"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m04.tgz
mv DBSingleClientW-PT-d2m04 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;