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.r295-tall-167873947600204.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 Philosophers-PT-000020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600204
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 21K Feb 25 13:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 13:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 25 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 25 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 171K Feb 25 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Feb 25 16:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 44K 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 Philosophers-PT-000020-LTLFireability-00
FORMULA_NAME Philosophers-PT-000020-LTLFireability-01
FORMULA_NAME Philosophers-PT-000020-LTLFireability-02
FORMULA_NAME Philosophers-PT-000020-LTLFireability-03
FORMULA_NAME Philosophers-PT-000020-LTLFireability-04
FORMULA_NAME Philosophers-PT-000020-LTLFireability-05
FORMULA_NAME Philosophers-PT-000020-LTLFireability-06
FORMULA_NAME Philosophers-PT-000020-LTLFireability-07
FORMULA_NAME Philosophers-PT-000020-LTLFireability-08
FORMULA_NAME Philosophers-PT-000020-LTLFireability-09
FORMULA_NAME Philosophers-PT-000020-LTLFireability-10
FORMULA_NAME Philosophers-PT-000020-LTLFireability-11
FORMULA_NAME Philosophers-PT-000020-LTLFireability-12
FORMULA_NAME Philosophers-PT-000020-LTLFireability-13
FORMULA_NAME Philosophers-PT-000020-LTLFireability-14
FORMULA_NAME Philosophers-PT-000020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678803126863

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:12:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:12:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:12:08] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-14 14:12:08] [INFO ] Transformed 100 places.
[2023-03-14 14:12:08] [INFO ] Transformed 100 transitions.
[2023-03-14 14:12:08] [INFO ] Found NUPN structural information;
[2023-03-14 14:12:08] [INFO ] Parsed PT model containing 100 places and 100 transitions and 320 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000020-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000020-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 100 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 100 cols
[2023-03-14 14:12:08] [INFO ] Computed 40 place invariants in 15 ms
[2023-03-14 14:12:08] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-14 14:12:08] [INFO ] Invariant cache hit.
[2023-03-14 14:12:08] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-14 14:12:08] [INFO ] Invariant cache hit.
[2023-03-14 14:12:08] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 100/100 places, 100/100 transitions.
Support contains 100 out of 100 places after structural reductions.
[2023-03-14 14:12:09] [INFO ] Flatten gal took : 33 ms
[2023-03-14 14:12:09] [INFO ] Flatten gal took : 13 ms
[2023-03-14 14:12:09] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 641 steps, including 0 resets, run visited all 21 properties in 34 ms. (steps per millisecond=18 )
Computed a total of 0 stabilizing places and 0 stable transitions
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(G(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:09] [INFO ] Invariant cache hit.
[2023-03-14 14:12:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-14 14:12:09] [INFO ] Invariant cache hit.
[2023-03-14 14:12:09] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-14 14:12:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 14:12:09] [INFO ] Invariant cache hit.
[2023-03-14 14:12:09] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 261 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-00 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (EQ s37 0) (EQ s58 0)) (OR (EQ s29 0) (EQ s50 0)) (OR (EQ s34 0) (EQ s53 0)) (OR (EQ s24 0) (EQ s41 0)) (OR (EQ s32 0) (EQ s51 0)) (OR (EQ s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1293 reset in 397 ms.
Stack based approach found an accepted trace after 290 steps with 10 reset with depth 10 and stack size 10 in 3 ms.
FORMULA Philosophers-PT-000020-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-00 finished in 964 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 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 13 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:10] [INFO ] Invariant cache hit.
[2023-03-14 14:12:10] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-14 14:12:10] [INFO ] Invariant cache hit.
[2023-03-14 14:12:10] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-14 14:12:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:12:10] [INFO ] Invariant cache hit.
[2023-03-14 14:12:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-01 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 (OR (NEQ s37 1) (NEQ s57 1)) (OR (NEQ s34 1) (NEQ s82 1)) (OR (NEQ s31 1) (NEQ s74 1)) (OR (NEQ s39 1) (NEQ s81 1)) (OR (NEQ s29 1) (NEQ s76 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 150 reset in 333 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-01 finished in 696 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(p0)||X(X(F(p1)))))'
Support contains 60 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:11] [INFO ] Invariant cache hit.
[2023-03-14 14:12:11] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-14 14:12:11] [INFO ] Invariant cache hit.
[2023-03-14 14:12:11] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-14 14:12:11] [INFO ] Invariant cache hit.
[2023-03-14 14:12:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (EQ s5 1) (EQ s26 1)) (AND (EQ s3 1) (EQ s24 1)) (AND (EQ s8 1) (EQ s27 1)) (AND (EQ s2 1) (EQ s21 1)) (AND (EQ s0 1) (EQ s19 1)) (AND (EQ s16...], 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 384 ms.
Product exploration explored 100000 steps with 33333 reset in 407 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000020-LTLFireability-02 finished in 1396 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(!p0))'
Support contains 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:12] [INFO ] Invariant cache hit.
[2023-03-14 14:12:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-14 14:12:12] [INFO ] Invariant cache hit.
[2023-03-14 14:12:12] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-14 14:12:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 14:12:12] [INFO ] Invariant cache hit.
[2023-03-14 14:12:12] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (NEQ s37 1) (NEQ s57 1)) (OR (NEQ s34 1) (NEQ s82 1)) (OR (NEQ s31 1) (NEQ s74 1)) (OR (NEQ s39 1) (NEQ s81 1)) (OR (NEQ s29 1) (NEQ s76 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 31853 reset in 472 ms.
Stack based approach found an accepted trace after 5288 steps with 1644 reset with depth 9 and stack size 9 in 26 ms.
FORMULA Philosophers-PT-000020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-03 finished in 772 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 40 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:13] [INFO ] Invariant cache hit.
[2023-03-14 14:12:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-14 14:12:13] [INFO ] Invariant cache hit.
[2023-03-14 14:12:13] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-14 14:12:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:12:13] [INFO ] Invariant cache hit.
[2023-03-14 14:12:13] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-04 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 (AND (EQ s5 1) (EQ s26 1)) (AND (EQ s3 1) (EQ s24 1)) (AND (EQ s8 1) (EQ s27 1)) (AND (EQ s2 1) (EQ s21 1)) (AND (EQ s0 1) (EQ s19 1)) (AND (EQ s16...], 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 326 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-04 finished in 259 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' '!((!p0 U (((p0 U G(p2))||X(!p2)||p1) U !p3)))'
Support contains 80 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:13] [INFO ] Invariant cache hit.
[2023-03-14 14:12:13] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-14 14:12:13] [INFO ] Invariant cache hit.
[2023-03-14 14:12:13] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-14 14:12:13] [INFO ] Invariant cache hit.
[2023-03-14 14:12:13] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 356 ms :[p3, p3, false, p2, false, true, (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 p0), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 p0), acceptance={} source=2 dest: 7}], [{ cond=p2, acceptance={} source=3 dest: 5}], [{ cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(AND (OR (NEQ s37 1) (NEQ s57 1)) (OR (NEQ s34 1) (NEQ s82 1)) (OR (NEQ s31 1) (NEQ s74 1)) (OR (NEQ s39 1) (NEQ s81 1)) (OR (NEQ s29 1) (NEQ s76 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1768 steps with 581 reset in 27 ms.
FORMULA Philosophers-PT-000020-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-06 finished in 592 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((p0||X(p0))))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:14] [INFO ] Invariant cache hit.
[2023-03-14 14:12:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-14 14:12:14] [INFO ] Invariant cache hit.
[2023-03-14 14:12:14] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-14 14:12:14] [INFO ] Invariant cache hit.
[2023-03-14 14:12:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(AND (EQ s3 1) (EQ s21 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-08 finished in 344 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&&F(p1)))||(p2 U G(p3))))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:14] [INFO ] Invariant cache hit.
[2023-03-14 14:12:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-14 14:12:14] [INFO ] Invariant cache hit.
[2023-03-14 14:12:14] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-14 14:12:14] [INFO ] Invariant cache hit.
[2023-03-14 14:12:14] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 441 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), true, (NOT p1), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 8}, { cond=(AND p3 (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p3 p2 (NOT p1)), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=8 dest: 8}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(NEQ s96 1), p2:(AND (EQ s29 1) (EQ s76 1)), p0:(OR (EQ s18 0) (EQ s34 0)), p1:(OR (EQ s29 0) (EQ s76 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 439 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-09 finished in 686 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 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:15] [INFO ] Invariant cache hit.
[2023-03-14 14:12:15] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-14 14:12:15] [INFO ] Invariant cache hit.
[2023-03-14 14:12:15] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2023-03-14 14:12:15] [INFO ] Invariant cache hit.
[2023-03-14 14:12:15] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 208 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-10 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:(OR (EQ s87 1) (AND (EQ s16 1) (EQ s36 1)) (AND (EQ s13 1) (EQ s36 1)))], 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 16 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-10 finished in 394 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((X(p1)&&p0)))'
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:15] [INFO ] Invariant cache hit.
[2023-03-14 14:12:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-14 14:12:15] [INFO ] Invariant cache hit.
[2023-03-14 14:12:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-14 14:12:15] [INFO ] Invariant cache hit.
[2023-03-14 14:12:16] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s64 1)), p1:(AND (EQ s28 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1154 steps with 3 reset in 6 ms.
FORMULA Philosophers-PT-000020-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-11 finished in 348 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(F((!p0||G(p1)))) U G((p2 U !p3)))))'
Support contains 6 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-14 14:12:16] [INFO ] Invariant cache hit.
[2023-03-14 14:12:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-14 14:12:16] [INFO ] Invariant cache hit.
[2023-03-14 14:12:16] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-14 14:12:16] [INFO ] Invariant cache hit.
[2023-03-14 14:12:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 100/100 places, 100/100 transitions.
Stuttering acceptance computed with spot in 206 ms :[p3, p3, (AND p0 (NOT p1)), p3]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(NEQ s96 1), p2:(AND (EQ s6 1) (EQ s26 1)), p0:(AND (EQ s23 1) (EQ s42 1)), p1:(NEQ s77 1)], 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 7829 reset in 416 ms.
Stack based approach found an accepted trace after 433 steps with 32 reset with depth 14 and stack size 14 in 2 ms.
FORMULA Philosophers-PT-000020-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-13 finished in 858 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(p0)||F(p1)))'
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 30 place count 85 transition count 85
Applied a total of 30 rules in 21 ms. Remains 85 /100 variables (removed 15) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 85 cols
[2023-03-14 14:12:17] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-14 14:12:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-14 14:12:17] [INFO ] Invariant cache hit.
[2023-03-14 14:12:17] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-14 14:12:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:12:17] [INFO ] Invariant cache hit.
[2023-03-14 14:12:17] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/100 places, 85/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 85/100 places, 85/100 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s81 1), p0:(OR (AND (EQ s36 1) (EQ s55 1)) (AND (EQ s30 1) (EQ s49 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 776 steps with 6 reset in 7 ms.
FORMULA Philosophers-PT-000020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-14 finished in 341 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 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 100/100 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 82 transition count 82
Applied a total of 36 rules in 9 ms. Remains 82 /100 variables (removed 18) and now considering 82/100 (removed 18) transitions.
// Phase 1: matrix 82 rows 82 cols
[2023-03-14 14:12:17] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-14 14:12:17] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-14 14:12:17] [INFO ] Invariant cache hit.
[2023-03-14 14:12:17] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-14 14:12:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 14:12:17] [INFO ] Invariant cache hit.
[2023-03-14 14:12:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/100 places, 82/100 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 82/100 places, 82/100 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000020-LTLFireability-15 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 (EQ s15 1) (EQ s33 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 2916 steps with 43 reset in 14 ms.
FORMULA Philosophers-PT-000020-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000020-LTLFireability-15 finished in 315 ms.
All properties solved by simple procedures.
Total runtime 9353 ms.
ITS solved all properties within timeout

BK_STOP 1678803138620

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.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 LTLFireability -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="Philosophers-PT-000020"
export BK_EXAMINATION="LTLFireability"
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 Philosophers-PT-000020, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947600204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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