Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863539800236.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 NoC3x3-PT-1B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539800236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 7.3K Feb 26 09:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 09:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 09:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Feb 26 09:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 09:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 09:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 362K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678855753345

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=NoC3x3-PT-1B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 04:49:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 04:49:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 04:49:16] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2023-03-15 04:49:16] [INFO ] Transformed 1416 places.
[2023-03-15 04:49:16] [INFO ] Transformed 1640 transitions.
[2023-03-15 04:49:16] [INFO ] Found NUPN structural information;
[2023-03-15 04:49:16] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA NoC3x3-PT-1B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 352 places :
Symmetric choice reduction at 0 with 352 rule applications. Total rules 352 place count 1064 transition count 1288
Iterating global reduction 0 with 352 rules applied. Total rules applied 704 place count 1064 transition count 1288
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 895 place count 873 transition count 1097
Iterating global reduction 0 with 191 rules applied. Total rules applied 1086 place count 873 transition count 1097
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 78 transitions.
Iterating post reduction 0 with 78 rules applied. Total rules applied 1164 place count 873 transition count 1019
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 1201 place count 836 transition count 982
Iterating global reduction 1 with 37 rules applied. Total rules applied 1238 place count 836 transition count 982
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 1258 place count 836 transition count 962
Applied a total of 1258 rules in 421 ms. Remains 836 /1416 variables (removed 580) and now considering 962/1640 (removed 678) transitions.
// Phase 1: matrix 962 rows 836 cols
[2023-03-15 04:49:17] [INFO ] Computed 40 place invariants in 35 ms
[2023-03-15 04:49:18] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-15 04:49:18] [INFO ] Invariant cache hit.
[2023-03-15 04:49:19] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
[2023-03-15 04:49:19] [INFO ] Invariant cache hit.
[2023-03-15 04:49:19] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 836/1416 places, 962/1640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2891 ms. Remains : 836/1416 places, 962/1640 transitions.
Support contains 27 out of 836 places after structural reductions.
[2023-03-15 04:49:20] [INFO ] Flatten gal took : 124 ms
[2023-03-15 04:49:20] [INFO ] Flatten gal took : 67 ms
[2023-03-15 04:49:20] [INFO ] Input system was already deterministic with 962 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 720 ms. (steps per millisecond=13 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-15 04:49:21] [INFO ] Invariant cache hit.
[2023-03-15 04:49:21] [INFO ] [Real]Absence check using 40 positive place invariants in 32 ms returned sat
[2023-03-15 04:49:21] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-15 04:49:22] [INFO ] [Nat]Absence check using 40 positive place invariants in 26 ms returned sat
[2023-03-15 04:49:22] [INFO ] After 629ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-15 04:49:23] [INFO ] After 968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-15 04:49:23] [INFO ] After 1492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 28 ms.
Support contains 3 out of 836 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 773 edges and 836 vertex of which 529 / 836 are part of one of the 19 SCC in 8 ms
Free SCC test removed 510 places
Drop transitions removed 594 transitions
Reduce isomorphic transitions removed 594 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 326 transition count 352
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 310 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 309 transition count 351
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 35 place count 309 transition count 332
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 73 place count 290 transition count 332
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 84 place count 279 transition count 308
Iterating global reduction 3 with 11 rules applied. Total rules applied 95 place count 279 transition count 308
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 223 place count 215 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 224 place count 215 transition count 243
Performed 3 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 230 place count 212 transition count 267
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 232 place count 212 transition count 265
Free-agglomeration rule applied 103 times.
Iterating global reduction 5 with 103 rules applied. Total rules applied 335 place count 212 transition count 162
Reduce places removed 103 places and 0 transitions.
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Graph (complete) has 310 edges and 109 vertex of which 36 are kept as prefixes of interest. Removing 73 places using SCC suffix rule.1 ms
Discarding 73 places :
Also discarding 60 output transitions
Drop transitions removed 60 transitions
Iterating post reduction 5 with 124 rules applied. Total rules applied 459 place count 36 transition count 82
Drop transitions removed 29 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 6 with 35 rules applied. Total rules applied 494 place count 36 transition count 47
Applied a total of 494 rules in 143 ms. Remains 36 /836 variables (removed 800) and now considering 47/962 (removed 915) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 144 ms. Remains : 36/836 places, 47/962 transitions.
Finished random walk after 3354 steps, including 1 resets, run visited all 2 properties in 16 ms. (steps per millisecond=209 )
FORMULA NoC3x3-PT-1B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NoC3x3-PT-1B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 40 stabilizing places and 40 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G((F(p0)&&F(G(p1))))))))'
Support contains 1 out of 836 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 777 edges and 836 vertex of which 553 / 836 are part of one of the 20 SCC in 2 ms
Free SCC test removed 533 places
Ensure Unique test removed 601 transitions
Reduce isomorphic transitions removed 601 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 302 transition count 358
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 300 transition count 356
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 298 transition count 356
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 9 place count 298 transition count 339
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 43 place count 281 transition count 339
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 54 place count 270 transition count 315
Iterating global reduction 3 with 11 rules applied. Total rules applied 65 place count 270 transition count 315
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 179 place count 213 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 213 transition count 257
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 212 transition count 256
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 142 edges and 207 vertex of which 22 / 207 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 188 place count 196 transition count 255
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 24 rules applied. Total rules applied 212 place count 195 transition count 232
Applied a total of 212 rules in 97 ms. Remains 195 /836 variables (removed 641) and now considering 232/962 (removed 730) transitions.
[2023-03-15 04:49:24] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
// Phase 1: matrix 213 rows 195 cols
[2023-03-15 04:49:24] [INFO ] Computed 35 place invariants in 2 ms
[2023-03-15 04:49:24] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-15 04:49:24] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
[2023-03-15 04:49:24] [INFO ] Invariant cache hit.
[2023-03-15 04:49:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-15 04:49:24] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-15 04:49:24] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 04:49:24] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
[2023-03-15 04:49:24] [INFO ] Invariant cache hit.
[2023-03-15 04:49:24] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/836 places, 232/962 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 767 ms. Remains : 195/836 places, 232/962 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-00 finished in 1106 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(X(G(p1)))||p0))||G(p2)))'
Support contains 3 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 823 transition count 949
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 823 transition count 949
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 823 transition count 945
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 818 transition count 940
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 818 transition count 940
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 817 transition count 939
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 817 transition count 939
Applied a total of 42 rules in 111 ms. Remains 817 /836 variables (removed 19) and now considering 939/962 (removed 23) transitions.
// Phase 1: matrix 939 rows 817 cols
[2023-03-15 04:49:25] [INFO ] Computed 40 place invariants in 7 ms
[2023-03-15 04:49:25] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-15 04:49:25] [INFO ] Invariant cache hit.
[2023-03-15 04:49:26] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1084 ms to find 0 implicit places.
[2023-03-15 04:49:26] [INFO ] Invariant cache hit.
[2023-03-15 04:49:26] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/836 places, 939/962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1904 ms. Remains : 817/836 places, 939/962 transitions.
Stuttering acceptance computed with spot in 351 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 7}, { cond=p2, acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p2), acceptance={} source=6 dest: 1}, { cond=p2, acceptance={} source=6 dest: 2}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 6}]], initial=4, aps=[p1:(EQ s311 1), p2:(EQ s545 1), p0:(OR (EQ s424 1) (EQ s545 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-01 finished in 2285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 778 edges and 836 vertex of which 541 / 836 are part of one of the 20 SCC in 3 ms
Free SCC test removed 521 places
Ensure Unique test removed 587 transitions
Reduce isomorphic transitions removed 587 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 314 transition count 363
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 26 place count 303 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 301 transition count 360
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 28 place count 301 transition count 342
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 64 place count 283 transition count 342
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 75 place count 272 transition count 318
Iterating global reduction 3 with 11 rules applied. Total rules applied 86 place count 272 transition count 318
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 208 place count 211 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 210 place count 211 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 211 place count 210 transition count 254
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 147 edges and 204 vertex of which 28 / 204 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 4 with 7 rules applied. Total rules applied 218 place count 190 transition count 254
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 246 place count 190 transition count 226
Applied a total of 246 rules in 66 ms. Remains 190 /836 variables (removed 646) and now considering 226/962 (removed 736) transitions.
[2023-03-15 04:49:27] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
// Phase 1: matrix 207 rows 190 cols
[2023-03-15 04:49:27] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 04:49:27] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-15 04:49:27] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
[2023-03-15 04:49:27] [INFO ] Invariant cache hit.
[2023-03-15 04:49:27] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-15 04:49:27] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 431 ms to find 0 implicit places.
[2023-03-15 04:49:27] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 04:49:27] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
[2023-03-15 04:49:27] [INFO ] Invariant cache hit.
[2023-03-15 04:49:27] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/836 places, 226/962 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 709 ms. Remains : 190/836 places, 226/962 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-04 finished in 767 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 1 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 823 transition count 949
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 823 transition count 949
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 823 transition count 945
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 818 transition count 940
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 818 transition count 940
Applied a total of 40 rules in 90 ms. Remains 818 /836 variables (removed 18) and now considering 940/962 (removed 22) transitions.
// Phase 1: matrix 940 rows 818 cols
[2023-03-15 04:49:28] [INFO ] Computed 40 place invariants in 5 ms
[2023-03-15 04:49:28] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-15 04:49:28] [INFO ] Invariant cache hit.
[2023-03-15 04:49:29] [INFO ] Implicit Places using invariants and state equation in 852 ms returned []
Implicit Place search using SMT with State Equation took 1183 ms to find 0 implicit places.
[2023-03-15 04:49:29] [INFO ] Invariant cache hit.
[2023-03-15 04:49:30] [INFO ] Dead Transitions using invariants and state equation in 813 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 818/836 places, 940/962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2102 ms. Remains : 818/836 places, 940/962 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s146 0)], 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 50000 reset in 1175 ms.
Product exploration explored 100000 steps with 50000 reset in 949 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-1B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-1B-LTLFireability-06 finished in 4510 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||G(p1)))))'
Support contains 2 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 773 edges and 836 vertex of which 548 / 836 are part of one of the 20 SCC in 1 ms
Free SCC test removed 528 places
Ensure Unique test removed 594 transitions
Reduce isomorphic transitions removed 594 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 307 transition count 363
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 303 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 302 transition count 362
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 11 place count 302 transition count 344
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 47 place count 284 transition count 344
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 58 place count 273 transition count 320
Iterating global reduction 3 with 11 rules applied. Total rules applied 69 place count 273 transition count 320
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 189 place count 213 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 190 place count 213 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 192 place count 212 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 193 place count 212 transition count 261
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 194 place count 211 transition count 260
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 143 edges and 205 vertex of which 28 / 205 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 201 place count 191 transition count 260
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 229 place count 191 transition count 232
Applied a total of 229 rules in 66 ms. Remains 191 /836 variables (removed 645) and now considering 232/962 (removed 730) transitions.
[2023-03-15 04:49:32] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
// Phase 1: matrix 213 rows 191 cols
[2023-03-15 04:49:32] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 04:49:32] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-15 04:49:32] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
[2023-03-15 04:49:32] [INFO ] Invariant cache hit.
[2023-03-15 04:49:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-15 04:49:32] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-15 04:49:33] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 04:49:33] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
[2023-03-15 04:49:33] [INFO ] Invariant cache hit.
[2023-03-15 04:49:33] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 191/836 places, 232/962 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 675 ms. Remains : 191/836 places, 232/962 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s51 1), p0:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-07 finished in 783 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 U (G(p0)||(p0&&(p1 U (p2||G(p1)))))))))'
Support contains 3 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 774 edges and 836 vertex of which 556 / 836 are part of one of the 20 SCC in 1 ms
Free SCC test removed 536 places
Ensure Unique test removed 603 transitions
Reduce isomorphic transitions removed 603 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 1 place count 299 transition count 341
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 35 place count 282 transition count 341
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 46 place count 271 transition count 317
Iterating global reduction 0 with 11 rules applied. Total rules applied 57 place count 271 transition count 317
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 0 with 116 rules applied. Total rules applied 173 place count 213 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 174 place count 212 transition count 258
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 147 edges and 206 vertex of which 28 / 206 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 181 place count 192 transition count 258
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 209 place count 192 transition count 230
Applied a total of 209 rules in 53 ms. Remains 192 /836 variables (removed 644) and now considering 230/962 (removed 732) transitions.
[2023-03-15 04:49:33] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 192 cols
[2023-03-15 04:49:33] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 04:49:33] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-15 04:49:33] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2023-03-15 04:49:33] [INFO ] Invariant cache hit.
[2023-03-15 04:49:33] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-15 04:49:33] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-15 04:49:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-15 04:49:33] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2023-03-15 04:49:33] [INFO ] Invariant cache hit.
[2023-03-15 04:49:34] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 192/836 places, 230/962 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 708 ms. Remains : 192/836 places, 230/962 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NEQ s134 1) (NEQ s151 1)), p1:(NEQ s151 1), p0:(NEQ s82 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 62 steps with 1 reset in 2 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-08 finished in 898 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)&&(p1||(G(p0) U G(p2))))))'
Support contains 3 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 773 edges and 836 vertex of which 530 / 836 are part of one of the 19 SCC in 1 ms
Free SCC test removed 511 places
Ensure Unique test removed 577 transitions
Reduce isomorphic transitions removed 577 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 324 transition count 369
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 309 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 308 transition count 368
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 33 place count 308 transition count 349
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 71 place count 289 transition count 349
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 82 place count 278 transition count 325
Iterating global reduction 3 with 11 rules applied. Total rules applied 93 place count 278 transition count 325
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 219 place count 215 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 215 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 214 transition count 265
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 224 place count 214 transition count 263
Applied a total of 224 rules in 62 ms. Remains 214 /836 variables (removed 622) and now considering 263/962 (removed 699) transitions.
[2023-03-15 04:49:34] [INFO ] Flow matrix only has 245 transitions (discarded 18 similar events)
// Phase 1: matrix 245 rows 214 cols
[2023-03-15 04:49:34] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-15 04:49:34] [INFO ] Implicit Places using invariants in 171 ms returned [10, 38, 73, 118, 159, 191]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 174 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 208/836 places, 263/962 transitions.
Graph (trivial) has 146 edges and 208 vertex of which 26 / 208 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
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 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 194 transition count 236
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 194 transition count 234
Applied a total of 5 rules in 14 ms. Remains 194 /208 variables (removed 14) and now considering 234/263 (removed 29) transitions.
[2023-03-15 04:49:34] [INFO ] Flow matrix only has 216 transitions (discarded 18 similar events)
// Phase 1: matrix 216 rows 194 cols
[2023-03-15 04:49:34] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 04:49:34] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-15 04:49:34] [INFO ] Flow matrix only has 216 transitions (discarded 18 similar events)
[2023-03-15 04:49:34] [INFO ] Invariant cache hit.
[2023-03-15 04:49:34] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-15 04:49:34] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 194/836 places, 234/962 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 637 ms. Remains : 194/836 places, 234/962 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s184 1), p1:(EQ s151 1), p2:(AND (EQ s151 1) (EQ s187 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-09 finished in 853 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 1 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 775 edges and 836 vertex of which 557 / 836 are part of one of the 20 SCC in 1 ms
Free SCC test removed 537 places
Ensure Unique test removed 606 transitions
Reduce isomorphic transitions removed 606 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 354
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 297 transition count 354
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 3 place count 297 transition count 337
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 37 place count 280 transition count 337
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 48 place count 269 transition count 313
Iterating global reduction 2 with 11 rules applied. Total rules applied 59 place count 269 transition count 313
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 175 place count 211 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 176 place count 210 transition count 254
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 144 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 184 place count 191 transition count 253
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 28 rules applied. Total rules applied 212 place count 190 transition count 226
Applied a total of 212 rules in 41 ms. Remains 190 /836 variables (removed 646) and now considering 226/962 (removed 736) transitions.
[2023-03-15 04:49:35] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
// Phase 1: matrix 207 rows 190 cols
[2023-03-15 04:49:35] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-15 04:49:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-15 04:49:35] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
[2023-03-15 04:49:35] [INFO ] Invariant cache hit.
[2023-03-15 04:49:35] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-15 04:49:35] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-15 04:49:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-15 04:49:35] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
[2023-03-15 04:49:35] [INFO ] Invariant cache hit.
[2023-03-15 04:49:35] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/836 places, 226/962 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 614 ms. Remains : 190/836 places, 226/962 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-11 finished in 669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 836 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Graph (trivial) has 776 edges and 836 vertex of which 551 / 836 are part of one of the 20 SCC in 0 ms
Free SCC test removed 531 places
Ensure Unique test removed 599 transitions
Reduce isomorphic transitions removed 599 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 304 transition count 358
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 300 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 299 transition count 357
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 11 place count 299 transition count 340
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 45 place count 282 transition count 340
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 56 place count 271 transition count 316
Iterating global reduction 3 with 11 rules applied. Total rules applied 67 place count 271 transition count 316
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 187 place count 211 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 211 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 189 place count 210 transition count 254
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 144 edges and 204 vertex of which 28 / 204 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 4 with 7 rules applied. Total rules applied 196 place count 190 transition count 254
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 5 with 28 rules applied. Total rules applied 224 place count 190 transition count 226
Applied a total of 224 rules in 63 ms. Remains 190 /836 variables (removed 646) and now considering 226/962 (removed 736) transitions.
[2023-03-15 04:49:35] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
// Phase 1: matrix 207 rows 190 cols
[2023-03-15 04:49:35] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-15 04:49:35] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-15 04:49:35] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
[2023-03-15 04:49:35] [INFO ] Invariant cache hit.
[2023-03-15 04:49:36] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-15 04:49:36] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-15 04:49:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-15 04:49:36] [INFO ] Flow matrix only has 207 transitions (discarded 19 similar events)
[2023-03-15 04:49:36] [INFO ] Invariant cache hit.
[2023-03-15 04:49:36] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 190/836 places, 226/962 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 711 ms. Remains : 190/836 places, 226/962 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s45 0) (EQ s24 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2913 steps with 58 reset in 40 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-12 finished in 847 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)&&F(G(p1)))))'
Support contains 2 out of 836 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 836/836 places, 962/962 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 824 transition count 950
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 824 transition count 950
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 824 transition count 947
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 818 transition count 941
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 818 transition count 941
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 817 transition count 940
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 817 transition count 940
Applied a total of 41 rules in 109 ms. Remains 817 /836 variables (removed 19) and now considering 940/962 (removed 22) transitions.
// Phase 1: matrix 940 rows 817 cols
[2023-03-15 04:49:36] [INFO ] Computed 40 place invariants in 6 ms
[2023-03-15 04:49:36] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-15 04:49:36] [INFO ] Invariant cache hit.
[2023-03-15 04:49:37] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2023-03-15 04:49:37] [INFO ] Invariant cache hit.
[2023-03-15 04:49:38] [INFO ] Dead Transitions using invariants and state equation in 976 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 817/836 places, 940/962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2251 ms. Remains : 817/836 places, 940/962 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s111 1), p1:(NEQ s691 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2700 steps with 2 reset in 8 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-14 finished in 2455 ms.
All properties solved by simple procedures.
Total runtime 22752 ms.
ITS solved all properties within timeout

BK_STOP 1678855780205

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-1B"
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 NoC3x3-PT-1B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863539800236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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