About the Execution of LoLa+red for CSRepetitions-COL-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 409.371 | 29373.00 | 46073.00 | 656.60 | FFFFFFFTTTFFFFFF | 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.r071-smll-167814397400028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CSRepetitions-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397400028
=====================================================================
--------------------
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 1678223076323
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-07 21:04:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-07 21:04:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 21:04:39] [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:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-07 21:04:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 815 ms
[2023-03-07 21:04:40] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 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:40] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2023-03-07 21:04:40] [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 228 steps, including 5 resets, run visited all 4 properties in 12 ms. (steps per millisecond=19 )
[2023-03-07 21:04:40] [INFO ] Flatten gal took : 16 ms
[2023-03-07 21:04:40] [INFO ] Flatten gal took : 2 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:40] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 15 ms.
[2023-03-07 21:04:40] [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 9 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:40] [INFO ] Computed 26 place invariants in 22 ms
[2023-03-07 21:04:40] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-07 21:04:40] [INFO ] Invariant cache hit.
[2023-03-07 21:04:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:41] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-07 21:04:41] [INFO ] Invariant cache hit.
[2023-03-07 21:04:41] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 102/102 places, 125/125 transitions.
Support contains 102 out of 102 places after structural reductions.
[2023-03-07 21:04:41] [INFO ] Flatten gal took : 50 ms
[2023-03-07 21:04:41] [INFO ] Flatten gal took : 28 ms
[2023-03-07 21:04:41] [INFO ] Input system was already deterministic with 125 transitions.
Finished random walk after 90 steps, including 2 resets, run visited all 9 properties in 12 ms. (steps per millisecond=7 )
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 4 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:42] [INFO ] Implicit Places using invariants in 74 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 145 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[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 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 453 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 75 steps with 8 reset in 4 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-00 finished in 913 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 1 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 25 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:42] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 21:04:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-07 21:04:42] [INFO ] Invariant cache hit.
[2023-03-07 21:04:42] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-07 21:04:42] [INFO ] Redundant transitions in 2 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 62 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 167 ms. Remains : 26/102 places, 75/125 transitions.
Stuttering acceptance computed with spot in 37 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 4765 reset in 455 ms.
Stack based approach found an accepted trace after 35 steps with 1 reset with depth 19 and stack size 19 in 7 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-01 finished in 683 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:43] [INFO ] Computed 26 place invariants in 3 ms
[2023-03-07 21:04:43] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-07 21:04:43] [INFO ] Invariant cache hit.
[2023-03-07 21:04:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:43] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-07 21:04:43] [INFO ] Invariant cache hit.
[2023-03-07 21:04:43] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 76 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 1873 reset in 386 ms.
Stack based approach found an accepted trace after 7627 steps with 146 reset with depth 10 and stack size 10 in 31 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-02 finished in 934 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 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:44] [INFO ] Invariant cache hit.
[2023-03-07 21:04:44] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-07 21:04:44] [INFO ] Invariant cache hit.
[2023-03-07 21:04:44] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:44] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-07 21:04:44] [INFO ] Invariant cache hit.
[2023-03-07 21:04:44] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 122 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 4 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 555 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 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:45] [INFO ] Invariant cache hit.
[2023-03-07 21:04:45] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-07 21:04:45] [INFO ] Invariant cache hit.
[2023-03-07 21:04:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:45] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-07 21:04:45] [INFO ] Invariant cache hit.
[2023-03-07 21:04:45] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 282 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 692 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:45] [INFO ] Invariant cache hit.
[2023-03-07 21:04:45] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-07 21:04:45] [INFO ] Invariant cache hit.
[2023-03-07 21:04:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:45] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-07 21:04:45] [INFO ] Invariant cache hit.
[2023-03-07 21:04:46] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 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 37 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-06 finished in 549 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:46] [INFO ] Invariant cache hit.
[2023-03-07 21:04:46] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-07 21:04:46] [INFO ] Invariant cache hit.
[2023-03-07 21:04:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:46] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-07 21:04:46] [INFO ] Invariant cache hit.
[2023-03-07 21:04:46] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 155 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 264 ms.
Product exploration explored 100000 steps with 50000 reset in 301 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 114 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 1158 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:47] [INFO ] Invariant cache hit.
[2023-03-07 21:04:47] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-07 21:04:47] [INFO ] Invariant cache hit.
[2023-03-07 21:04:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:47] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-07 21:04:47] [INFO ] Invariant cache hit.
[2023-03-07 21:04:47] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 207 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 24540 reset in 511 ms.
Product exploration explored 100000 steps with 24471 reset in 519 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 313 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 201 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Finished random walk after 55 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=18 )
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 343 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 184 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 185 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 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:50] [INFO ] Invariant cache hit.
[2023-03-07 21:04:50] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-07 21:04:50] [INFO ] Invariant cache hit.
[2023-03-07 21:04:50] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:50] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-07 21:04:50] [INFO ] Invariant cache hit.
[2023-03-07 21:04:50] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 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 185 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 228 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
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 181 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 181 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 180 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 180 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 19295 reset in 518 ms.
Product exploration explored 100000 steps with 19420 reset in 331 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 170 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 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:52] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-07 21:04:52] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 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:53] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-07 21:04:53] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:53] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-07 21:04:53] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 102/102 places, 125/125 transitions.
Treatment of property CSRepetitions-COL-05-LTLFireability-11 finished in 6008 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 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:53] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-07 21:04:53] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:53] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-07 21:04:53] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 21:04:53] [INFO ] Invariant cache hit.
[2023-03-07 21:04:53] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 162 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 2606 reset in 647 ms.
Stack based approach found an accepted trace after 38205 steps with 979 reset with depth 51 and stack size 51 in 298 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLFireability-13 finished in 1474 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 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:54] [INFO ] Invariant cache hit.
[2023-03-07 21:04:54] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-07 21:04:54] [INFO ] Invariant cache hit.
[2023-03-07 21:04:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:55] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-07 21:04:55] [INFO ] Invariant cache hit.
[2023-03-07 21:04:55] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 427 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 813 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 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:55] [INFO ] Invariant cache hit.
[2023-03-07 21:04:55] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-07 21:04:55] [INFO ] Invariant cache hit.
[2023-03-07 21:04:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:55] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-07 21:04:55] [INFO ] Invariant cache hit.
[2023-03-07 21:04:56] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 171 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 20744 reset in 550 ms.
Product exploration explored 100000 steps with 20802 reset in 394 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 354 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 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 1295 steps, including 26 resets, run visited all 4 properties in 36 ms. (steps per millisecond=35 )
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 439 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 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-07 21:04:58] [INFO ] Invariant cache hit.
[2023-03-07 21:04:58] [INFO ] [Real]Absence check using 26 positive place invariants in 12 ms returned sat
[2023-03-07 21:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:04:58] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2023-03-07 21:04:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:59] [INFO ] [Real]Added 25 Read/Feed constraints in 8 ms returned sat
[2023-03-07 21:04:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:04:59] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-07 21:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:04:59] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-07 21:04:59] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-07 21:04:59] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-07 21:04:59] [INFO ] Added : 2 causal constraints over 1 iterations in 46 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 11 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:04:59] [INFO ] Invariant cache hit.
[2023-03-07 21:04:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-07 21:04:59] [INFO ] Invariant cache hit.
[2023-03-07 21:04:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:04:59] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-07 21:04:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-07 21:04:59] [INFO ] Invariant cache hit.
[2023-03-07 21:04:59] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 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 691 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 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 251 steps, including 4 resets, run visited all 4 properties in 5 ms. (steps per millisecond=50 )
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 417 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 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
[2023-03-07 21:05:01] [INFO ] Invariant cache hit.
[2023-03-07 21:05:01] [INFO ] [Real]Absence check using 26 positive place invariants in 8 ms returned sat
[2023-03-07 21:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 21:05:01] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-07 21:05:01] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:05:01] [INFO ] [Real]Added 25 Read/Feed constraints in 4 ms returned sat
[2023-03-07 21:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 21:05:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-07 21:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 21:05:01] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-07 21:05:01] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2023-03-07 21:05:01] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-07 21:05:01] [INFO ] Added : 2 causal constraints over 1 iterations in 35 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 29733 reset in 346 ms.
Product exploration explored 100000 steps with 29482 reset in 397 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 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:05:02] [INFO ] Invariant cache hit.
[2023-03-07 21:05:02] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-07 21:05:02] [INFO ] Invariant cache hit.
[2023-03-07 21:05:02] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:05:02] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-07 21:05:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-07 21:05:02] [INFO ] Invariant cache hit.
[2023-03-07 21:05:03] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 102/102 places, 125/125 transitions.
Treatment of property CSRepetitions-COL-05-LTLFireability-15 finished in 7443 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 141 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 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-07 21:05:03] [INFO ] Invariant cache hit.
[2023-03-07 21:05:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-07 21:05:03] [INFO ] Invariant cache hit.
[2023-03-07 21:05:03] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-07 21:05:03] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-07 21:05:03] [INFO ] Invariant cache hit.
[2023-03-07 21:05:03] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 330 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 20859 reset in 333 ms.
Stack based approach found an accepted trace after 10094 steps with 2209 reset with depth 23 and stack size 23 in 37 ms.
Treatment of property CSRepetitions-COL-05-LTLFireability-15 finished in 958 ms.
FORMULA CSRepetitions-COL-05-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-07 21:05:04] [INFO ] Flatten gal took : 13 ms
[2023-03-07 21:05:04] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-07 21:05:04] [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 24876 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CSRepetitions-COL-05
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability
FORMULA CSRepetitions-COL-05-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA CSRepetitions-COL-05-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678223105696
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 CSRepetitions-COL-05-LTLFireability-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CSRepetitions-COL-05-LTLFireability-15
lola: result : false
lola: markings : 1068
lola: fired transitions : 9288
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CSRepetitions-COL-05-LTLFireability-11
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for CSRepetitions-COL-05-LTLFireability-11
lola: result : false
lola: markings : 11221
lola: fired transitions : 13027
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CSRepetitions-COL-05-LTLFireability-11: LTL false LTL model checker
CSRepetitions-COL-05-LTLFireability-15: LTL false LTL model checker
Time elapsed: 0 secs. Pages in use: 1
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="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r071-smll-167814397400028"
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 '
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 ;