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.r327-tall-167889199600467.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 Referendum-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199600467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 11K Feb 26 17:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 17:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 26 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 147K Feb 26 17:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0010-LTLCardinality-00
FORMULA_NAME Referendum-PT-0010-LTLCardinality-01
FORMULA_NAME Referendum-PT-0010-LTLCardinality-02
FORMULA_NAME Referendum-PT-0010-LTLCardinality-03
FORMULA_NAME Referendum-PT-0010-LTLCardinality-04
FORMULA_NAME Referendum-PT-0010-LTLCardinality-05
FORMULA_NAME Referendum-PT-0010-LTLCardinality-06
FORMULA_NAME Referendum-PT-0010-LTLCardinality-07
FORMULA_NAME Referendum-PT-0010-LTLCardinality-08
FORMULA_NAME Referendum-PT-0010-LTLCardinality-09
FORMULA_NAME Referendum-PT-0010-LTLCardinality-10
FORMULA_NAME Referendum-PT-0010-LTLCardinality-11
FORMULA_NAME Referendum-PT-0010-LTLCardinality-12
FORMULA_NAME Referendum-PT-0010-LTLCardinality-13
FORMULA_NAME Referendum-PT-0010-LTLCardinality-14
FORMULA_NAME Referendum-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679049518921

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=Referendum-PT-0010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:38:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 10:38:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:38:40] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-17 10:38:40] [INFO ] Transformed 31 places.
[2023-03-17 10:38:40] [INFO ] Transformed 21 transitions.
[2023-03-17 10:38:40] [INFO ] Found NUPN structural information;
[2023-03-17 10:38:40] [INFO ] Parsed PT model containing 31 places and 21 transitions and 51 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0010-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0010-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2023-03-17 10:38:40] [INFO ] Computed 10 place invariants in 7 ms
[2023-03-17 10:38:40] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-17 10:38:40] [INFO ] Invariant cache hit.
[2023-03-17 10:38:40] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-17 10:38:40] [INFO ] Invariant cache hit.
[2023-03-17 10:38:40] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 250 ms. Remains : 31/31 places, 21/21 transitions.
Support contains 31 out of 31 places after structural reductions.
[2023-03-17 10:38:41] [INFO ] Flatten gal took : 14 ms
[2023-03-17 10:38:41] [INFO ] Flatten gal took : 4 ms
[2023-03-17 10:38:41] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 35 steps, including 2 resets, run visited all 17 properties in 21 ms. (steps per millisecond=1 )
FORMULA Referendum-PT-0010-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 31 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Referendum-PT-0010-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((G(p0) U X(X(p1))))'
Support contains 20 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-17 10:38:41] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:38:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 10:38:41] [INFO ] Invariant cache hit.
[2023-03-17 10:38:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-17 10:38:41] [INFO ] Invariant cache hit.
[2023-03-17 10:38:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/31 places, 21/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Computed a total of 21 stabilizing places and 21 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 277 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLCardinality-00 finished in 1194 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' '!(G((F(G((p0||X(F(p1)))))&&(X(F(p1))||F(!p2)))))'
Support contains 30 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 31 cols
[2023-03-17 10:38:42] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-17 10:38:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-17 10:38:42] [INFO ] Invariant cache hit.
[2023-03-17 10:38:42] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-17 10:38:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:38:42] [INFO ] Invariant cache hit.
[2023-03-17 10:38:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 31/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p1:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s21 s22 s23 s24 s25 s26 s27 s28 s29 s30)), p2:(L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 94420 steps with 9862 reset in 326 ms.
FORMULA Referendum-PT-0010-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-01 finished in 562 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' '!(G((F(p0)&&F(p1))))'
Support contains 21 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-17 10:38:43] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:38:43] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-17 10:38:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 21/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ 2 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 4 reset in 1 ms.
FORMULA Referendum-PT-0010-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-02 finished in 233 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' '!(F(G(!p0)))'
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 2 ms. Remains 20 /31 variables (removed 11) and now considering 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 20 cols
[2023-03-17 10:38:43] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:38:43] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [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.
[2023-03-17 10:38:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/31 places, 20/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 20/31 places, 20/21 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9))], 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 10 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-03 finished in 158 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' '!(F((G(p0)||G(F(p1)))))'
Support contains 20 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 21 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-17 10:38:43] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:38:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 10:38:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/31 places, 21/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20)), p1:(GT (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20) (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-04 finished in 169 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' '!(G((G((p0||G(!p1)))||X(!p1))))'
Support contains 20 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:43] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:38:43] [INFO ] Invariant cache hit.
[2023-03-17 10:38:44] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 10:38:44] [INFO ] Invariant cache hit.
[2023-03-17 10:38:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/31 places, 21/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, p1]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(LEQ 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ 3 (ADD s11 s12 s13 s14 s15 s16 s17 s18 s19 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-05 finished in 310 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((F(p0)||G(p1))))'
Support contains 11 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 21
Applied a total of 10 rules in 1 ms. Remains 21 /31 variables (removed 10) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2023-03-17 10:38:44] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:38:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:38:44] [INFO ] Invariant cache hit.
[2023-03-17 10:38:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 10:38:44] [INFO ] Invariant cache hit.
[2023-03-17 10:38:44] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/31 places, 21/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 21/31 places, 21/21 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(GT s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1514 steps with 259 reset in 4 ms.
FORMULA Referendum-PT-0010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-06 finished in 214 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(F((G(p1)||p0))))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 14 transition count 14
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 8 transition count 8
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 8 transition count 8
Applied a total of 36 rules in 2 ms. Remains 8 /31 variables (removed 23) and now considering 8/21 (removed 13) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-17 10:38:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:38:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:38:44] [INFO ] Invariant cache hit.
[2023-03-17 10:38:44] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 10:38:44] [INFO ] Invariant cache hit.
[2023-03-17 10:38:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8/31 places, 8/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 8/31 places, 8/21 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (EQ s3 0) (EQ s4 1)), p0:(OR (EQ s2 0) (EQ s4 1) (AND (EQ s0 0) (EQ s1 1) (EQ s4 0) (EQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0010-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0010-LTLCardinality-10 finished in 550 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' '!(G(F(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 4 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.0 ms
Discarding 27 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 4 transition count 4
Applied a total of 3 rules in 5 ms. Remains 4 /31 variables (removed 27) and now considering 4/21 (removed 17) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 10:38:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:38:45] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 10:38:45] [INFO ] Invariant cache hit.
[2023-03-17 10:38:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 10:38:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:38:45] [INFO ] Invariant cache hit.
[2023-03-17 10:38:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/31 places, 4/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 4/31 places, 4/21 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-11 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:(AND (NEQ s3 0) (NEQ 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 7 steps with 2 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-11 finished in 152 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(F(p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 12 transition count 12
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 4 transition count 4
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 4 transition count 4
Applied a total of 44 rules in 1 ms. Remains 4 /31 variables (removed 27) and now considering 4/21 (removed 17) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-17 10:38:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:38:45] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:38:45] [INFO ] Invariant cache hit.
[2023-03-17 10:38:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 10:38:45] [INFO ] Invariant cache hit.
[2023-03-17 10:38:45] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/31 places, 4/21 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 4/31 places, 4/21 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s0 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-13 finished in 139 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' '!(F((F(G(p1))&&p0)))'
Support contains 2 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 21/21 transitions.
Graph (complete) has 30 edges and 31 vertex of which 3 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Applied a total of 2 rules in 3 ms. Remains 3 /31 variables (removed 28) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:38:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:38:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:38:45] [INFO ] Invariant cache hit.
[2023-03-17 10:38:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:38:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:38:45] [INFO ] Invariant cache hit.
[2023-03-17 10:38:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/31 places, 3/21 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 3/31 places, 3/21 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : Referendum-PT-0010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s0 1)), p1:(AND (NEQ s0 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0010-LTLCardinality-15 finished in 178 ms.
All properties solved by simple procedures.
Total runtime 5153 ms.
ITS solved all properties within timeout

BK_STOP 1679049526741

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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

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="Referendum-PT-0010"
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 Referendum-PT-0010, 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 r327-tall-167889199600467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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