Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r131-smll-171624288400152.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DLCround-PT-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-171624288400152
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 17:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 13 17:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Apr 13 16:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 762K May 18 16:42 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 DLCround-PT-11a-LTLCardinality-00
FORMULA_NAME DLCround-PT-11a-LTLCardinality-01
FORMULA_NAME DLCround-PT-11a-LTLCardinality-02
FORMULA_NAME DLCround-PT-11a-LTLCardinality-03
FORMULA_NAME DLCround-PT-11a-LTLCardinality-04
FORMULA_NAME DLCround-PT-11a-LTLCardinality-05
FORMULA_NAME DLCround-PT-11a-LTLCardinality-06
FORMULA_NAME DLCround-PT-11a-LTLCardinality-07
FORMULA_NAME DLCround-PT-11a-LTLCardinality-08
FORMULA_NAME DLCround-PT-11a-LTLCardinality-09
FORMULA_NAME DLCround-PT-11a-LTLCardinality-10
FORMULA_NAME DLCround-PT-11a-LTLCardinality-11
FORMULA_NAME DLCround-PT-11a-LTLCardinality-12
FORMULA_NAME DLCround-PT-11a-LTLCardinality-13
FORMULA_NAME DLCround-PT-11a-LTLCardinality-14
FORMULA_NAME DLCround-PT-11a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716398008950

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 17:13:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 17:13:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:13:32] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2024-05-22 17:13:32] [INFO ] Transformed 377 places.
[2024-05-22 17:13:33] [INFO ] Transformed 2993 transitions.
[2024-05-22 17:13:33] [INFO ] Found NUPN structural information;
[2024-05-22 17:13:33] [INFO ] Parsed PT model containing 377 places and 2993 transitions and 11677 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 280 transitions
Reduce redundant transitions removed 280 transitions.
FORMULA DLCround-PT-11a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 377 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 377/377 places, 2713/2713 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 348 transition count 2248
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 348 transition count 2248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 348 transition count 2244
Drop transitions removed 666 transitions
Redundant transition composition rules discarded 666 transitions
Iterating global reduction 1 with 666 rules applied. Total rules applied 728 place count 348 transition count 1578
Applied a total of 728 rules in 271 ms. Remains 348 /377 variables (removed 29) and now considering 1578/2713 (removed 1135) transitions.
[2024-05-22 17:13:33] [INFO ] Flow matrix only has 201 transitions (discarded 1377 similar events)
// Phase 1: matrix 201 rows 348 cols
[2024-05-22 17:13:33] [INFO ] Computed 244 invariants in 32 ms
[2024-05-22 17:13:36] [INFO ] Implicit Places using invariants in 2464 ms returned [120, 121, 122, 123, 124, 125, 127, 129, 130, 132, 133, 134, 135, 136, 137, 138, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239, 240, 242, 244, 245, 246, 247, 248, 249, 250, 251, 252, 254, 255, 256, 257, 259, 260, 261, 262, 263, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 306, 307, 308, 309, 310, 311, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347]
Discarding 210 places :
Ensure Unique test removed 1205 transitions
Reduce isomorphic transitions removed 1205 transitions.
Implicit Place search using SMT only with invariants took 2539 ms to find 210 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/377 places, 373/2713 transitions.
Drop transitions removed 114 transitions
Redundant transition composition rules discarded 114 transitions
Iterating global reduction 0 with 114 rules applied. Total rules applied 114 place count 138 transition count 259
Applied a total of 114 rules in 11 ms. Remains 138 /138 variables (removed 0) and now considering 259/373 (removed 114) transitions.
[2024-05-22 17:13:36] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
// Phase 1: matrix 201 rows 138 cols
[2024-05-22 17:13:36] [INFO ] Computed 34 invariants in 7 ms
[2024-05-22 17:13:36] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 17:13:36] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2024-05-22 17:13:36] [INFO ] Invariant cache hit.
[2024-05-22 17:13:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:36] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 138/377 places, 259/2713 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3112 ms. Remains : 138/377 places, 259/2713 transitions.
Support contains 29 out of 138 places after structural reductions.
[2024-05-22 17:13:36] [INFO ] Flatten gal took : 56 ms
[2024-05-22 17:13:36] [INFO ] Flatten gal took : 21 ms
[2024-05-22 17:13:36] [INFO ] Input system was already deterministic with 259 transitions.
Support contains 26 out of 138 places (down from 29) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 581 ms. (steps per millisecond=17 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-05-22 17:13:37] [INFO ] Flow matrix only has 201 transitions (discarded 58 similar events)
[2024-05-22 17:13:37] [INFO ] Invariant cache hit.
[2024-05-22 17:13:37] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-05-22 17:13:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2024-05-22 17:13:37] [INFO ] After 145ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DLCround-PT-11a-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
FORMULA DLCround-PT-11a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-11a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 1 stable transitions
Graph (complete) has 292 edges and 138 vertex of which 120 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.9 ms
FORMULA DLCround-PT-11a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 259/259 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 122 transition count 259
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 119 transition count 253
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 119 transition count 253
Applied a total of 22 rules in 6 ms. Remains 119 /138 variables (removed 19) and now considering 253/259 (removed 6) transitions.
[2024-05-22 17:13:38] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
// Phase 1: matrix 198 rows 119 cols
[2024-05-22 17:13:38] [INFO ] Computed 18 invariants in 3 ms
[2024-05-22 17:13:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 17:13:38] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2024-05-22 17:13:38] [INFO ] Invariant cache hit.
[2024-05-22 17:13:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:38] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-22 17:13:38] [INFO ] Flow matrix only has 198 transitions (discarded 55 similar events)
[2024-05-22 17:13:38] [INFO ] Invariant cache hit.
[2024-05-22 17:13:38] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/138 places, 253/259 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 119/138 places, 253/259 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 398 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DLCround-PT-11a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s117 1), p1:(EQ s118 1)], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 537 ms.
Product exploration explored 100000 steps with 50000 reset in 410 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 270 edges and 119 vertex of which 117 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/119 stabilizing places and 1/253 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 31 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DLCround-PT-11a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-11a-LTLCardinality-00 finished in 1898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 259/259 transitions.
Graph (trivial) has 255 edges and 138 vertex of which 118 / 138 are part of one of the 16 SCC in 4 ms
Free SCC test removed 102 places
Ensure Unique test removed 239 transitions
Reduce isomorphic transitions removed 239 transitions.
Graph (complete) has 53 edges and 36 vertex of which 19 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 16 place count 5 transition count 6
Iterating global reduction 0 with 14 rules applied. Total rules applied 30 place count 5 transition count 6
Applied a total of 30 rules in 15 ms. Remains 5 /138 variables (removed 133) and now considering 6/259 (removed 253) transitions.
[2024-05-22 17:13:40] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
// Phase 1: matrix 4 rows 5 cols
[2024-05-22 17:13:40] [INFO ] Computed 3 invariants in 1 ms
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 17:13:40] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-22 17:13:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 17:13:40] [INFO ] Flow matrix only has 4 transitions (discarded 2 similar events)
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/138 places, 6/259 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 5/138 places, 6/259 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-11a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s4 0) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-LTLCardinality-05 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 259/259 transitions.
Graph (trivial) has 251 edges and 138 vertex of which 115 / 138 are part of one of the 17 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Graph (complete) has 63 edges and 40 vertex of which 22 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 22 transition count 29
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 28
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 18 place count 8 transition count 15
Iterating global reduction 2 with 13 rules applied. Total rules applied 31 place count 8 transition count 15
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 8 transition count 14
Applied a total of 32 rules in 13 ms. Remains 8 /138 variables (removed 130) and now considering 14/259 (removed 245) transitions.
[2024-05-22 17:13:40] [INFO ] Flow matrix only has 8 transitions (discarded 6 similar events)
// Phase 1: matrix 8 rows 8 cols
[2024-05-22 17:13:40] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 17:13:40] [INFO ] Flow matrix only has 8 transitions (discarded 6 similar events)
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-22 17:13:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 17:13:40] [INFO ] Flow matrix only has 8 transitions (discarded 6 similar events)
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/138 places, 14/259 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 8/138 places, 14/259 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-11a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-LTLCardinality-06 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 259/259 transitions.
Graph (trivial) has 249 edges and 138 vertex of which 113 / 138 are part of one of the 16 SCC in 1 ms
Free SCC test removed 97 places
Ensure Unique test removed 227 transitions
Reduce isomorphic transitions removed 227 transitions.
Graph (complete) has 65 edges and 41 vertex of which 23 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 7 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 6 transition count 16
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 6 transition count 10
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 6 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 5 transition count 9
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 4 transition count 8
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 4 transition count 8
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 44 place count 4 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 48 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 50 place count 2 transition count 3
Applied a total of 50 rules in 16 ms. Remains 2 /138 variables (removed 136) and now considering 3/259 (removed 256) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 17:13:40] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-22 17:13:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/138 places, 3/259 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 2/138 places, 3/259 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-11a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DLCround-PT-11a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-11a-LTLCardinality-08 finished in 213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 259/259 transitions.
Graph (trivial) has 258 edges and 138 vertex of which 119 / 138 are part of one of the 16 SCC in 1 ms
Free SCC test removed 103 places
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Graph (complete) has 50 edges and 35 vertex of which 18 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 17 place count 3 transition count 2
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 3 transition count 2
Applied a total of 32 rules in 6 ms. Remains 3 /138 variables (removed 135) and now considering 2/259 (removed 257) transitions.
// Phase 1: matrix 2 rows 3 cols
[2024-05-22 17:13:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-22 17:13:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 17:13:40] [INFO ] Invariant cache hit.
[2024-05-22 17:13:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/138 places, 2/259 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 3/138 places, 2/259 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : DLCround-PT-11a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 268 ms.
Product exploration explored 100000 steps with 0 reset in 106 ms.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2024-05-22 17:13:41] [INFO ] Invariant cache hit.
[2024-05-22 17:13:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 17:13:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 17:13:41] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-22 17:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:41] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:13:41] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-22 17:13:41] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2024-05-22 17:13:41] [INFO ] Invariant cache hit.
[2024-05-22 17:13:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-22 17:13:41] [INFO ] Invariant cache hit.
[2024-05-22 17:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-22 17:13:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 17:13:41] [INFO ] Invariant cache hit.
[2024-05-22 17:13:41] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 3/3 places, 2/2 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 3 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 3 stabilizing places and 1 stable transitions
Detected a total of 3/3 stabilizing places and 1/2 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-22 17:13:42] [INFO ] Invariant cache hit.
[2024-05-22 17:13:42] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 17:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 17:13:42] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-22 17:13:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 17:13:42] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-22 17:13:42] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-22 17:13:42] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 73 ms.
Product exploration explored 100000 steps with 0 reset in 180 ms.
Built C files in :
/tmp/ltsmin2321977267384079160
[2024-05-22 17:13:42] [INFO ] Computing symmetric may disable matrix : 2 transitions.
[2024-05-22 17:13:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 17:13:42] [INFO ] Computing symmetric may enable matrix : 2 transitions.
[2024-05-22 17:13:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 17:13:42] [INFO ] Computing Do-Not-Accords matrix : 2 transitions.
[2024-05-22 17:13:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 17:13:42] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2321977267384079160
Running compilation step : cd /tmp/ltsmin2321977267384079160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 415 ms.
Running link step : cd /tmp/ltsmin2321977267384079160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin2321977267384079160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16811500718471967355.hoa' '--buchi-type=spotba'
LTSmin run took 102 ms.
FORMULA DLCround-PT-11a-LTLCardinality-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DLCround-PT-11a-LTLCardinality-14 finished in 2565 ms.
All properties solved by simple procedures.
Total runtime 10853 ms.

BK_STOP 1716398024354

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-11a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DLCround-PT-11a, 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 r131-smll-171624288400152"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11a.tgz
mv DLCround-PT-11a 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 ;