fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r265-smll-167863540200556
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Peterson-COL-2

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
361.004 12435.00 19864.00 645.30 TFFTTFFTFFTFFFTT normal

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.r265-smll-167863540200556.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 ltsminxred
Input is Peterson-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 5.3K Feb 25 22:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 25 22:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 21:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 21:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 22:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 22:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K 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 Peterson-COL-2-LTLFireability-00
FORMULA_NAME Peterson-COL-2-LTLFireability-01
FORMULA_NAME Peterson-COL-2-LTLFireability-02
FORMULA_NAME Peterson-COL-2-LTLFireability-03
FORMULA_NAME Peterson-COL-2-LTLFireability-04
FORMULA_NAME Peterson-COL-2-LTLFireability-05
FORMULA_NAME Peterson-COL-2-LTLFireability-06
FORMULA_NAME Peterson-COL-2-LTLFireability-07
FORMULA_NAME Peterson-COL-2-LTLFireability-08
FORMULA_NAME Peterson-COL-2-LTLFireability-09
FORMULA_NAME Peterson-COL-2-LTLFireability-10
FORMULA_NAME Peterson-COL-2-LTLFireability-11
FORMULA_NAME Peterson-COL-2-LTLFireability-12
FORMULA_NAME Peterson-COL-2-LTLFireability-13
FORMULA_NAME Peterson-COL-2-LTLFireability-14
FORMULA_NAME Peterson-COL-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679095196137

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 23:19:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 23:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 23:19:58] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 23:19:59] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 23:19:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 711 ms
[2023-03-17 23:19:59] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 108 PT places and 159.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 23:20:00] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2023-03-17 23:20:00] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Peterson-COL-2-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-2-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 65 steps, including 0 resets, run visited all 6 properties in 12 ms. (steps per millisecond=5 )
[2023-03-17 23:20:00] [INFO ] Flatten gal took : 18 ms
[2023-03-17 23:20:00] [INFO ] Flatten gal took : 3 ms
Domain [Process(3), Tour(2), Process(3)] of place BeginLoop breaks symmetries in sort Process
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
Arc [2:1*[$i, (MOD (ADD $j 1) 2)]] contains successor/predecessor on variables of sort Tour
[2023-03-17 23:20:00] [INFO ] Unfolded HLPN to a Petri net with 108 places and 138 transitions 432 arcs in 25 ms.
[2023-03-17 23:20:00] [INFO ] Unfolded 10 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 12 transitions.
FORMULA Peterson-COL-2-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 12 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 23:20:00] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-17 23:20:00] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-17 23:20:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:00] [INFO ] Invariant cache hit.
[2023-03-17 23:20:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 23:20:00] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-03-17 23:20:00] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:00] [INFO ] Invariant cache hit.
[2023-03-17 23:20:00] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 78 out of 102 places after structural reductions.
[2023-03-17 23:20:00] [INFO ] Flatten gal took : 22 ms
[2023-03-17 23:20:00] [INFO ] Flatten gal took : 22 ms
[2023-03-17 23:20:01] [INFO ] Input system was already deterministic with 126 transitions.
Finished random walk after 195 steps, including 0 resets, run visited all 16 properties in 37 ms. (steps per millisecond=5 )
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' '!(X(F((X(p1)&&p0))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:01] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:01] [INFO ] Invariant cache hit.
[2023-03-17 23:20:01] [INFO ] Implicit Places using invariants in 113 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 304 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s29 1) (LT s30 1) (LT s31 1) (LT s32 1) (LT s33 1) (LT s34 1) (LT s36 1) (LT s35 1) (LT s38 1) (LT s37 1) (LT s40 1) (LT s39 1) (LT s41 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 441 ms.
Product exploration explored 100000 steps with 33333 reset in 372 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 p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLFireability-03 finished in 1494 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) U X(G(p1)))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:02] [INFO ] Invariant cache hit.
[2023-03-17 23:20:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-17 23:20:02] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:02] [INFO ] Invariant cache hit.
[2023-03-17 23:20:03] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 23:20:03] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-17 23:20:03] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:03] [INFO ] Invariant cache hit.
[2023-03-17 23:20:03] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Peterson-COL-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s12 1) (GEQ s18 1)) (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s11 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s16 1)) (AND (GEQ s9 1) (GEQ s15 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 10307 reset in 278 ms.
Stack based approach found an accepted trace after 76 steps with 7 reset with depth 52 and stack size 52 in 1 ms.
FORMULA Peterson-COL-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-05 finished in 821 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)&&G(F(p1))))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 20 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2023-03-17 23:20:03] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2023-03-17 23:20:03] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 23:20:03] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 45/102 places, 72/126 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s30 1) (GEQ s32 1) (GEQ s28 1)), p1:(OR (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s10 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s15 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7721 reset in 172 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA Peterson-COL-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-06 finished in 431 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 U p1)) U X(p1))))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 23:20:04] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 23:20:04] [INFO ] Implicit Places using invariants in 82 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s62 1) (GEQ s64 1) (GEQ s63 1) (GEQ s66 1) (GEQ s52 1) (GEQ s67 1) (GEQ s53 1) (GEQ s56 1) (GEQ s55 1) (GEQ s57 1) (GEQ s60 1) (GEQ s59 1)), p...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLFireability-08 finished in 314 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(((p2 U (G(p3)||(p3&&X(p2))))||p1))||p0)))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:04] [INFO ] Invariant cache hit.
[2023-03-17 23:20:04] [INFO ] Implicit Places using invariants in 66 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), true, (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={0} source=1 dest: 6}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 7}], [{ cond=p3, acceptance={} source=3 dest: 3}, { cond=(NOT p3), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 6}]], initial=5, aps=[p0:(OR (AND (GEQ s12 1) (GEQ s22 1)) (AND (GEQ s13 1) (GEQ s18 1)) (AND (GEQ s14 1) (GEQ s18 1)) (AND (GEQ s17 1) (GEQ s21 1)) (AND (GEQ s17 1) (GEQ s19 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-2-LTLFireability-09 finished in 382 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(p1)||p0))))'
Support contains 33 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 124
Reduce places removed 2 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 8 rules applied. Total rules applied 10 place count 100 transition count 118
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 16 place count 94 transition count 118
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 16 place count 94 transition count 112
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 28 place count 88 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 36 place count 84 transition count 108
Applied a total of 36 rules in 19 ms. Remains 84 /102 variables (removed 18) and now considering 108/126 (removed 18) transitions.
[2023-03-17 23:20:04] [INFO ] Flow matrix only has 102 transitions (discarded 6 similar events)
// Phase 1: matrix 102 rows 84 cols
[2023-03-17 23:20:04] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 23:20:04] [INFO ] Implicit Places using invariants in 65 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/102 places, 108/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 81 /81 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 92 ms. Remains : 81/102 places, 108/126 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (LT s26 1) (LT s27 1) (LT s28 1) (LT s29 1) (LT s30 1) (LT s31 1) (LT s33 1) (LT s32 1) (LT s35 1) (LT s34 1) (LT s37 1) (LT s36 1) (LT s38 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1125 reset in 255 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Peterson-COL-2-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-11 finished in 542 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((X(F((p1&&F(p2))))||p0))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 102 transition count 102
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 78 transition count 102
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 48 place count 78 transition count 84
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 84 place count 60 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 54 transition count 78
Applied a total of 96 rules in 13 ms. Remains 54 /102 variables (removed 48) and now considering 78/126 (removed 48) transitions.
[2023-03-17 23:20:05] [INFO ] Flow matrix only has 72 transitions (discarded 6 similar events)
// Phase 1: matrix 72 rows 54 cols
[2023-03-17 23:20:05] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 23:20:05] [INFO ] Implicit Places using invariants in 46 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/102 places, 78/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 51/102 places, 78/126 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s10 1) (GEQ s15 1)) (AND (GEQ s11 1) (GEQ s15 1)) (AND (GEQ s14 1) (GEQ s18 1)) (AND (GEQ s14 1) (GEQ s16 1)...], 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 12220 reset in 376 ms.
Stack based approach found an accepted trace after 181 steps with 24 reset with depth 10 and stack size 10 in 1 ms.
FORMULA Peterson-COL-2-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-2-LTLFireability-12 finished in 581 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((G(p2)||p1))||p0)))'
Support contains 33 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:05] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 23:20:05] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-17 23:20:05] [INFO ] Implicit Places using invariants in 56 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 58 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-COL-2-LTLFireability-14 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s9 1) (GEQ s15 1)) (AND (GEQ s9 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s12 1)) (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s6 1) (GEQ s12 1)) (A...], 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 200 ms.
Product exploration explored 100000 steps with 50000 reset in 187 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 (NOT p0) p2 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLFireability-14 finished in 741 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(G(!p1)))))'
Support contains 21 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 23:20:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 23:20:06] [INFO ] Invariant cache hit.
[2023-03-17 23:20:06] [INFO ] Implicit Places using invariants in 58 ms returned [0, 1, 2]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), p1, (AND (NOT p0) p1)]
Running random walk in product with property : Peterson-COL-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (LT s61 1) (LT s65 1) (LT s68 1) (LT s51 1) (LT s54 1) (LT s58 1)), p1:(AND (OR (LT s2 1) (LT s80 1)) (OR (LT s4 1) (LT s76 1)) (OR (LT s2 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 184 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 p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-2-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-2-LTLFireability-15 finished in 622 ms.
All properties solved by simple procedures.
Total runtime 8657 ms.
ITS solved all properties within timeout

BK_STOP 1679095208572

--------------------
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 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="Peterson-COL-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-COL-2, 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 r265-smll-167863540200556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-2.tgz
mv Peterson-COL-2 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 ;