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.r073-smll-167814399000028.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 CSRepetitions-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399000028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 11:56 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 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 12:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 136K Feb 25 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 15K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678223056574

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=CSRepetitions-COL-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-07 21:04:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 21:04:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 21:04:19] [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-07 21:04:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 21:04:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 637 ms
[2023-03-07 21:04:19] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA CSRepetitions-COL-05-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-07 21:04:19] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2023-03-07 21:04:19] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA CSRepetitions-COL-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-05-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
Finished random walk after 189 steps, including 4 resets, run visited all 4 properties in 96 ms. (steps per millisecond=1 )
[2023-03-07 21:04:20] [INFO ] Flatten gal took : 17 ms
[2023-03-07 21:04:20] [INFO ] Flatten gal took : 3 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 5
[2023-03-07 21:04:20] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 15 ms.
[2023-03-07 21:04:20] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 102 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2023-03-07 21:04:20] [INFO ] Computed 26 place invariants in 15 ms
[2023-03-07 21:04:20] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-07 21:04:20] [INFO ] Invariant cache hit.
[2023-03-07 21:04:20] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:20] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-03-07 21:04:20] [INFO ] Invariant cache hit.
[2023-03-07 21:04:20] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 102/102 places, 125/125 transitions.
Support contains 102 out of 102 places after structural reductions.
[2023-03-07 21:04:20] [INFO ] Flatten gal took : 32 ms
[2023-03-07 21:04:20] [INFO ] Flatten gal took : 32 ms
[2023-03-07 21:04:21] [INFO ] Input system was already deterministic with 125 transitions.
Finished random walk after 63 steps, including 0 resets, run visited all 9 properties in 15 ms. (steps per millisecond=4 )
Computed a total of 0 stabilizing places and 25 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(p0)&&F(p1)) U X(G((X(!p1)||p2)))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:21] [INFO ] Invariant cache hit.
[2023-03-07 21:04:21] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-07 21:04:21] [INFO ] Invariant cache hit.
[2023-03-07 21:04:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:21] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-07 21:04:21] [INFO ] Invariant cache hit.
[2023-03-07 21:04:22] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 886 ms :[(AND (NOT p2) p1), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), p1, true, (AND (NOT p0) p1), (AND p1 (NOT p2)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 0}, { cond=(AND p0 p1), acceptance={} source=6 dest: 1}, { cond=(AND p0 p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=2, aps=[p2:(OR (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GE...], 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 8 steps with 2 reset in 2 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-00 finished in 1487 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 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 99 place count 28 transition count 76
Iterating global reduction 0 with 24 rules applied. Total rules applied 123 place count 28 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 126 place count 26 transition count 75
Applied a total of 126 rules in 28 ms. Remains 26 /102 variables (removed 76) and now considering 75/125 (removed 50) transitions.
// Phase 1: matrix 75 rows 26 cols
[2023-03-07 21:04:23] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-07 21:04:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-07 21:04:23] [INFO ] Invariant cache hit.
[2023-03-07 21:04:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-07 21:04:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-07 21:04:23] [INFO ] Invariant cache hit.
[2023-03-07 21:04:23] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/102 places, 75/125 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 26/102 places, 75/125 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s1 1) (GEQ s2 1) (GEQ s3 1) (GEQ s4 1) (GEQ s5 1) (GEQ s6 1) (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (GEQ s10 1) (GEQ s11 1) (GEQ s12 1) (GEQ s14 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 4751 reset in 480 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-01 finished in 736 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 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2023-03-07 21:04:23] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-07 21:04:23] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-07 21:04:23] [INFO ] Invariant cache hit.
[2023-03-07 21:04:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:24] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-07 21:04:24] [INFO ] Invariant cache hit.
[2023-03-07 21:04:24] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-02 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 (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], 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]]
Product exploration explored 100000 steps with 1885 reset in 414 ms.
Stack based approach found an accepted trace after 28721 steps with 542 reset with depth 27 and stack size 27 in 130 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-02 finished in 1012 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 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:24] [INFO ] Invariant cache hit.
[2023-03-07 21:04:24] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-07 21:04:24] [INFO ] Invariant cache hit.
[2023-03-07 21:04:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:25] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-07 21:04:25] [INFO ] Invariant cache hit.
[2023-03-07 21:04:25] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-04 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:(AND (OR (LT s36 1) (LT s51 1)) (OR (LT s37 1) (LT s51 1)) (OR (LT s26 1) (LT s51 1)) (OR (LT s32 1) (LT s51 1)) (OR (LT s41 1) (LT s51 1)) (OR (LT s47...], 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 7 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-04 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(!p1 U (G(!p1)||(!p1&&G(p0))))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:25] [INFO ] Invariant cache hit.
[2023-03-07 21:04:25] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-07 21:04:25] [INFO ] Invariant cache hit.
[2023-03-07 21:04:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:25] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-07 21:04:25] [INFO ] Invariant cache hit.
[2023-03-07 21:04:25] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][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 CSRepetitions-COL-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-05 finished in 700 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||X(G(p0))))))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:26] [INFO ] Invariant cache hit.
[2023-03-07 21:04:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-07 21:04:26] [INFO ] Invariant cache hit.
[2023-03-07 21:04:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:26] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2023-03-07 21:04:26] [INFO ] Invariant cache hit.
[2023-03-07 21:04:26] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 346 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), false, false]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s26 1) (GEQ s27 1) (GEQ s28 1) (GEQ s29 1) (GEQ s30 1) (GEQ s31 1) (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GE...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-06 finished in 504 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((X(p1)||(p1&&X(!p2))||p0))))'
Support contains 100 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:26] [INFO ] Invariant cache hit.
[2023-03-07 21:04:26] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-07 21:04:26] [INFO ] Invariant cache hit.
[2023-03-07 21:04:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-07 21:04:26] [INFO ] Invariant cache hit.
[2023-03-07 21:04:26] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s65 1) (GEQ s64 1) (GEQ s67 1) (GEQ s66 1) (GEQ s69 1) (GEQ s68 1) (GEQ s71 1) (GEQ s70 1) (GEQ s73 1) (GEQ s72 1) (GEQ s75 1) (GEQ s74 1) (GE...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 296 ms.
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-COL-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLFireability-07 finished in 1249 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)||G((F(!p1)||X(G(!p0))))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:27] [INFO ] Invariant cache hit.
[2023-03-07 21:04:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-07 21:04:27] [INFO ] Invariant cache hit.
[2023-03-07 21:04:28] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:28] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-07 21:04:28] [INFO ] Invariant cache hit.
[2023-03-07 21:04:28] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 208 ms :[false, false, (AND p1 p0), (AND p1 p0), p1]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s91 1)) (AND (GEQ s10 1) (GEQ s86 1)) (AND (GEQ s20 1) (GEQ s96 1)) (AND (GEQ s21 1) (GEQ s97 1)) (AND (GEQ s25 1) (GEQ s101 ...], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 24364 reset in 516 ms.
Product exploration explored 100000 steps with 24623 reset in 564 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND p1 (NOT p0))), true, (X (X p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 276 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Finished random walk after 135 steps, including 3 resets, run visited all 2 properties in 7 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND p1 (NOT p0))), true, (X (X p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(F p1), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 387 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 191 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:30] [INFO ] Invariant cache hit.
[2023-03-07 21:04:30] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-07 21:04:30] [INFO ] Invariant cache hit.
[2023-03-07 21:04:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:30] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-07 21:04:30] [INFO ] Invariant cache hit.
[2023-03-07 21:04:30] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Finished random walk after 103 steps, including 2 resets, run visited all 2 properties in 4 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true, (X (X p1))]
False Knowledge obtained : [(F p1), (F (AND p0 p1))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 186 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 191 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 19473 reset in 319 ms.
Product exploration explored 100000 steps with 19359 reset in 356 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 213 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:33] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 102/102 places, 125/125 transitions.
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:33] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 102/102 places, 125/125 transitions.
Treatment of property CSRepetitions-COL-05-LTLFireability-11 finished in 5802 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(G(p1)))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:33] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-07 21:04:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 21:04:33] [INFO ] Invariant cache hit.
[2023-03-07 21:04:33] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=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:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s22 1)) (AND (GEQ s0 1) (GEQ s17 1)) (A...], 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 2593 reset in 547 ms.
Stack based approach found an accepted trace after 22023 steps with 542 reset with depth 8 and stack size 8 in 109 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-13 finished in 1087 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((X(X(G((p1&&F(!p2)))))&&p0))))'
Support contains 77 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:34] [INFO ] Invariant cache hit.
[2023-03-07 21:04:34] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-07 21:04:34] [INFO ] Invariant cache hit.
[2023-03-07 21:04:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:34] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-07 21:04:34] [INFO ] Invariant cache hit.
[2023-03-07 21:04:35] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p0) p2), (OR (NOT p1) (NOT p0) p2), true, (OR (NOT p1) p2), (OR (NOT p1) p2), p2]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], 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 CSRepetitions-COL-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-14 finished in 632 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(F(p0)) U G(p1))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:35] [INFO ] Invariant cache hit.
[2023-03-07 21:04:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-07 21:04:35] [INFO ] Invariant cache hit.
[2023-03-07 21:04:35] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:35] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-07 21:04:35] [INFO ] Invariant cache hit.
[2023-03-07 21:04:35] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-15 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=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], 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 21183 reset in 358 ms.
Product exploration explored 100000 steps with 21066 reset in 408 ms.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 425 steps, including 6 resets, run visited all 4 properties in 13 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 398 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-07 21:04:38] [INFO ] Invariant cache hit.
[2023-03-07 21:04:38] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2023-03-07 21:04:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:04:38] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-07 21:04:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:38] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-07 21:04:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:04:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-07 21:04:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:04:38] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-07 21:04:38] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
[2023-03-07 21:04:38] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-07 21:04:38] [INFO ] Added : 2 causal constraints over 1 iterations in 50 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:38] [INFO ] Invariant cache hit.
[2023-03-07 21:04:38] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-07 21:04:38] [INFO ] Invariant cache hit.
[2023-03-07 21:04:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:38] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-07 21:04:38] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-07 21:04:38] [INFO ] Invariant cache hit.
[2023-03-07 21:04:39] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 25 stable transitions
Computed a total of 0 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 367 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 304 steps, including 5 resets, run visited all 4 properties in 19 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) p1)), (F p1), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 446 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-07 21:04:40] [INFO ] Invariant cache hit.
[2023-03-07 21:04:40] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-07 21:04:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:04:40] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-07 21:04:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:40] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-07 21:04:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:04:40] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-07 21:04:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:04:40] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-07 21:04:40] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-07 21:04:40] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-07 21:04:40] [INFO ] Added : 2 causal constraints over 1 iterations in 34 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29488 reset in 379 ms.
Product exploration explored 100000 steps with 29424 reset in 417 ms.
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:41] [INFO ] Invariant cache hit.
[2023-03-07 21:04:41] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-07 21:04:41] [INFO ] Invariant cache hit.
[2023-03-07 21:04:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:42] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-07 21:04:42] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 21:04:42] [INFO ] Invariant cache hit.
[2023-03-07 21:04:42] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 102/102 places, 125/125 transitions.
Treatment of property CSRepetitions-COL-05-LTLFireability-15 finished in 6879 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)||G((F(!p1)||X(G(!p0))))))'
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(F(p0)) U G(p1))))'
Found a Lengthening insensitive property : CSRepetitions-COL-05-LTLFireability-15
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 5 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:42] [INFO ] Invariant cache hit.
[2023-03-07 21:04:42] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-07 21:04:42] [INFO ] Invariant cache hit.
[2023-03-07 21:04:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:42] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-07 21:04:42] [INFO ] Invariant cache hit.
[2023-03-07 21:04:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 356 ms. Remains : 102/102 places, 125/125 transitions.
Running random walk in product with property : CSRepetitions-COL-05-LTLFireability-15 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=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s65 1) (LT s64 1) (LT s67 1) (LT s66 1) (LT s69 1) (LT s68 1) (LT s71 1) (LT s70 1) (LT s73 1) (LT s72 1) (LT s75 1) (LT s74 1) (LT s76 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21042 reset in 356 ms.
Stack based approach found an accepted trace after 56204 steps with 11550 reset with depth 6 and stack size 6 in 211 ms.
Treatment of property CSRepetitions-COL-05-LTLFireability-15 finished in 1189 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-07 21:04:43] [INFO ] Flatten gal took : 14 ms
[2023-03-07 21:04:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-07 21:04:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 102 places, 125 transitions and 375 arcs took 2 ms.
Total runtime 24685 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1393/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1785 seconds
MemTotal: 16393216 kB
MemFree: 9806216 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16081760 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1393/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CSRepetitions-COL-05-LTLFireability-11
Could not compute solution for formula : CSRepetitions-COL-05-LTLFireability-15

BK_STOP 1678224871473

--------------------
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
mcc2023
ltl formula name CSRepetitions-COL-05-LTLFireability-11
ltl formula formula --ltl=/tmp/1393/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 102 places, 125 transitions and 375 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1393/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1393/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1393/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1393/ltl_0_
Killing (15) : 1399 1400 1401 1402 1403
Killing (9) : 1399 1400 1401 1402 1403
ltl formula name CSRepetitions-COL-05-LTLFireability-15
ltl formula formula --ltl=/tmp/1393/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 102 places, 125 transitions and 375 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1393/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1393/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1393/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1393/ltl_1_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins
corrupted size vs. prev_size in fastbins

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="CSRepetitions-COL-05"
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 CSRepetitions-COL-05, 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 r073-smll-167814399000028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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