Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998400148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-3A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998400148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 360K
-rw-r--r-- 1 mcc users 6.2K Apr 29 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 133K May 10 09:34 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-3A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-3A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652980905544

Running Version 202205111006
[2022-05-19 17:21:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 17:21:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:21:47] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2022-05-19 17:21:47] [INFO ] Transformed 370 places.
[2022-05-19 17:21:47] [INFO ] Transformed 450 transitions.
[2022-05-19 17:21:47] [INFO ] Found NUPN structural information;
[2022-05-19 17:21:47] [INFO ] Parsed PT model containing 370 places and 450 transitions in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA NoC3x3-PT-3A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 354 transition count 449
Discarding 97 places :
Symmetric choice reduction at 1 with 97 rule applications. Total rules 113 place count 257 transition count 331
Ensure Unique test removed 35 places
Iterating global reduction 1 with 132 rules applied. Total rules applied 245 place count 222 transition count 331
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 307 place count 222 transition count 269
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 331 place count 222 transition count 245
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 338 place count 215 transition count 245
Applied a total of 338 rules in 72 ms. Remains 215 /370 variables (removed 155) and now considering 245/449 (removed 204) transitions.
[2022-05-19 17:21:48] [INFO ] Flow matrix only has 234 transitions (discarded 11 similar events)
// Phase 1: matrix 234 rows 215 cols
[2022-05-19 17:21:48] [INFO ] Computed 69 place invariants in 30 ms
[2022-05-19 17:21:48] [INFO ] Implicit Places using invariants in 389 ms returned []
[2022-05-19 17:21:48] [INFO ] Flow matrix only has 234 transitions (discarded 11 similar events)
// Phase 1: matrix 234 rows 215 cols
[2022-05-19 17:21:48] [INFO ] Computed 69 place invariants in 7 ms
[2022-05-19 17:21:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:49] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
[2022-05-19 17:21:49] [INFO ] Flow matrix only has 234 transitions (discarded 11 similar events)
// Phase 1: matrix 234 rows 215 cols
[2022-05-19 17:21:49] [INFO ] Computed 69 place invariants in 13 ms
[2022-05-19 17:21:49] [INFO ] Dead Transitions using invariants and state equation in 375 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 215/370 places, 245/449 transitions.
Finished structural reductions, in 1 iterations. Remains : 215/370 places, 245/449 transitions.
Support contains 56 out of 215 places after structural reductions.
[2022-05-19 17:21:50] [INFO ] Flatten gal took : 116 ms
[2022-05-19 17:21:50] [INFO ] Flatten gal took : 59 ms
[2022-05-19 17:21:50] [INFO ] Input system was already deterministic with 245 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 628 ms. (steps per millisecond=15 ) properties (out of 31) seen :30
Finished Best-First random walk after 5594 steps, including 1 resets, run visited all 1 properties in 15 ms. (steps per millisecond=372 )
FORMULA NoC3x3-PT-3A-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 634 edges and 215 vertex of which 213 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.28 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(G(p1)&&F(p2))))'
Support contains 7 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 245
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 196 transition count 226
Ensure Unique test removed 8 places
Iterating global reduction 1 with 24 rules applied. Total rules applied 43 place count 188 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 52 place count 188 transition count 217
Applied a total of 52 rules in 24 ms. Remains 188 /215 variables (removed 27) and now considering 217/245 (removed 28) transitions.
[2022-05-19 17:21:51] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 188 cols
[2022-05-19 17:21:51] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:21:51] [INFO ] Implicit Places using invariants in 232 ms returned []
[2022-05-19 17:21:51] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 188 cols
[2022-05-19 17:21:51] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-19 17:21:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:52] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2022-05-19 17:21:52] [INFO ] Flow matrix only has 209 transitions (discarded 8 similar events)
// Phase 1: matrix 209 rows 188 cols
[2022-05-19 17:21:52] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-19 17:21:52] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/215 places, 217/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/215 places, 217/245 transitions.
Stuttering acceptance computed with spot in 624 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s56 1) (EQ s72 1)), p2:(AND (EQ s73 1) (EQ s137 1)), p0:(OR (EQ s12 1) (AND (EQ s59 1) (EQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, 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 1 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-00 finished in 1787 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0) U p0))))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 211 transition count 245
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 21 place count 194 transition count 225
Ensure Unique test removed 8 places
Iterating global reduction 1 with 25 rules applied. Total rules applied 46 place count 186 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 55 place count 186 transition count 216
Applied a total of 55 rules in 20 ms. Remains 186 /215 variables (removed 29) and now considering 216/245 (removed 29) transitions.
[2022-05-19 17:21:53] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2022-05-19 17:21:53] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 17:21:53] [INFO ] Implicit Places using invariants in 215 ms returned []
[2022-05-19 17:21:53] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2022-05-19 17:21:53] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-19 17:21:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:53] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
[2022-05-19 17:21:53] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2022-05-19 17:21:53] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-19 17:21:54] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/215 places, 216/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/215 places, 216/245 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-03 finished in 1161 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 245
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 195 transition count 225
Ensure Unique test removed 8 places
Iterating global reduction 1 with 25 rules applied. Total rules applied 45 place count 187 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 54 place count 187 transition count 216
Applied a total of 54 rules in 17 ms. Remains 187 /215 variables (removed 28) and now considering 216/245 (removed 29) transitions.
[2022-05-19 17:21:54] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2022-05-19 17:21:54] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:21:54] [INFO ] Implicit Places using invariants in 210 ms returned []
[2022-05-19 17:21:54] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2022-05-19 17:21:54] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-19 17:21:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:55] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2022-05-19 17:21:55] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2022-05-19 17:21:55] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:21:55] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/215 places, 216/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/215 places, 216/245 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-04 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 (EQ s136 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-04 finished in 1059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F((X(p1)&&X(F(p2))))&&p0))))'
Support contains 10 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 211 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 197 transition count 228
Ensure Unique test removed 6 places
Iterating global reduction 1 with 20 rules applied. Total rules applied 38 place count 191 transition count 228
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 45 place count 191 transition count 221
Applied a total of 45 rules in 16 ms. Remains 191 /215 variables (removed 24) and now considering 221/245 (removed 24) transitions.
[2022-05-19 17:21:55] [INFO ] Flow matrix only has 213 transitions (discarded 8 similar events)
// Phase 1: matrix 213 rows 191 cols
[2022-05-19 17:21:55] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-19 17:21:55] [INFO ] Implicit Places using invariants in 192 ms returned []
[2022-05-19 17:21:55] [INFO ] Flow matrix only has 213 transitions (discarded 8 similar events)
// Phase 1: matrix 213 rows 191 cols
[2022-05-19 17:21:55] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-19 17:21:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:56] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 580 ms to find 0 implicit places.
[2022-05-19 17:21:56] [INFO ] Flow matrix only has 213 transitions (discarded 8 similar events)
// Phase 1: matrix 213 rows 191 cols
[2022-05-19 17:21:56] [INFO ] Computed 59 place invariants in 4 ms
[2022-05-19 17:21:56] [INFO ] Dead Transitions using invariants and state equation in 301 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/215 places, 221/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 191/215 places, 221/245 transitions.
Stuttering acceptance computed with spot in 302 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p2:(AND (EQ s155 1) (EQ s160 1) (EQ s180 1) (EQ s190 1)), p1:(AND (EQ s32 1) (EQ s78 1) (EQ s41 1) (EQ s53 1)), p0:(AND (EQ s152 1) (EQ s170 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-05 finished in 1224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!((p0 U F(p1)) U X(G(p2)))&&p3)))'
Support contains 6 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 211 transition count 245
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 197 transition count 229
Ensure Unique test removed 7 places
Iterating global reduction 1 with 21 rules applied. Total rules applied 39 place count 190 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 47 place count 190 transition count 221
Applied a total of 47 rules in 13 ms. Remains 190 /215 variables (removed 25) and now considering 221/245 (removed 24) transitions.
[2022-05-19 17:21:56] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
// Phase 1: matrix 212 rows 190 cols
[2022-05-19 17:21:56] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:21:56] [INFO ] Implicit Places using invariants in 200 ms returned []
[2022-05-19 17:21:56] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
// Phase 1: matrix 212 rows 190 cols
[2022-05-19 17:21:56] [INFO ] Computed 58 place invariants in 8 ms
[2022-05-19 17:21:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:57] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
[2022-05-19 17:21:57] [INFO ] Flow matrix only has 212 transitions (discarded 9 similar events)
// Phase 1: matrix 212 rows 190 cols
[2022-05-19 17:21:57] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:21:57] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/215 places, 221/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 190/215 places, 221/245 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p3) p2), (AND p1 p2), p2, false]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}, { cond=(AND p3 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s171 0) (EQ s178 0)), p1:(AND (EQ s137 1) (EQ s145 1)), p2:(AND (EQ s59 1) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 423 reset in 982 ms.
Stuttering criterion allowed to conclude after 514 steps with 2 reset in 4 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-06 finished in 2047 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Graph (complete) has 634 edges and 215 vertex of which 213 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 211 transition count 194
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 160 transition count 194
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 120 place count 143 transition count 174
Ensure Unique test removed 8 places
Iterating global reduction 2 with 25 rules applied. Total rules applied 145 place count 135 transition count 174
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 17 rules applied. Total rules applied 162 place count 135 transition count 157
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 170 place count 127 transition count 157
Applied a total of 170 rules in 29 ms. Remains 127 /215 variables (removed 88) and now considering 157/245 (removed 88) transitions.
[2022-05-19 17:21:58] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2022-05-19 17:21:58] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 17:21:58] [INFO ] Implicit Places using invariants in 119 ms returned []
[2022-05-19 17:21:58] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2022-05-19 17:21:58] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-19 17:21:59] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-05-19 17:21:59] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2022-05-19 17:21:59] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-19 17:21:59] [INFO ] Flow matrix only has 149 transitions (discarded 8 similar events)
// Phase 1: matrix 149 rows 127 cols
[2022-05-19 17:21:59] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-19 17:21:59] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/215 places, 157/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/215 places, 157/245 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s91 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-09 finished in 592 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(G(!G(p1))&&G(p2))) U !F(p0))))'
Support contains 6 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 211 transition count 245
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 20 place count 195 transition count 226
Ensure Unique test removed 7 places
Iterating global reduction 1 with 23 rules applied. Total rules applied 43 place count 188 transition count 226
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 51 place count 188 transition count 218
Applied a total of 51 rules in 6 ms. Remains 188 /215 variables (removed 27) and now considering 218/245 (removed 27) transitions.
[2022-05-19 17:21:59] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2022-05-19 17:21:59] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:21:59] [INFO ] Implicit Places using invariants in 102 ms returned []
[2022-05-19 17:21:59] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2022-05-19 17:21:59] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:21:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:21:59] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2022-05-19 17:21:59] [INFO ] Flow matrix only has 210 transitions (discarded 8 similar events)
// Phase 1: matrix 210 rows 188 cols
[2022-05-19 17:21:59] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:00] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/215 places, 218/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 188/215 places, 218/245 transitions.
Stuttering acceptance computed with spot in 337 ms :[p0, p0, p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s116 1) (EQ s135 1)), p2:(AND (EQ s87 1) (EQ s91 1)), p1:(AND (EQ s79 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-10 finished in 1117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((p0 U (X(p1)||F(p0))))))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Graph (complete) has 634 edges and 215 vertex of which 213 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 211 transition count 193
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 159 transition count 193
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 120 place count 144 transition count 175
Ensure Unique test removed 7 places
Iterating global reduction 2 with 22 rules applied. Total rules applied 142 place count 137 transition count 175
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 2 with 15 rules applied. Total rules applied 157 place count 137 transition count 160
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 164 place count 130 transition count 160
Applied a total of 164 rules in 31 ms. Remains 130 /215 variables (removed 85) and now considering 160/245 (removed 85) transitions.
[2022-05-19 17:22:00] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
// Phase 1: matrix 152 rows 130 cols
[2022-05-19 17:22:00] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:00] [INFO ] Implicit Places using invariants in 164 ms returned []
[2022-05-19 17:22:00] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
// Phase 1: matrix 152 rows 130 cols
[2022-05-19 17:22:00] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:00] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-19 17:22:00] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2022-05-19 17:22:00] [INFO ] Redundant transitions in 9 ms returned []
[2022-05-19 17:22:00] [INFO ] Flow matrix only has 152 transitions (discarded 8 similar events)
// Phase 1: matrix 152 rows 130 cols
[2022-05-19 17:22:00] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:01] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/215 places, 160/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 130/215 places, 160/245 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s18 1) (EQ s33 1)), p0:(AND (EQ s10 1) (EQ s21 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 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-11 finished in 867 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(X(F(p0))))||p1)))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Graph (complete) has 634 edges and 215 vertex of which 213 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 210 transition count 190
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 122 place count 149 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 122 place count 149 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 147 transition count 183
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 125 place count 147 transition count 182
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 145 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 145 transition count 180
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 145 place count 130 transition count 162
Ensure Unique test removed 6 places
Iterating global reduction 3 with 21 rules applied. Total rules applied 166 place count 124 transition count 162
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 14 rules applied. Total rules applied 180 place count 124 transition count 148
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 190 place count 116 transition count 146
Applied a total of 190 rules in 46 ms. Remains 116 /215 variables (removed 99) and now considering 146/245 (removed 99) transitions.
// Phase 1: matrix 146 rows 116 cols
[2022-05-19 17:22:01] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-19 17:22:01] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 146 rows 116 cols
[2022-05-19 17:22:01] [INFO ] Computed 48 place invariants in 6 ms
[2022-05-19 17:22:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 17:22:01] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2022-05-19 17:22:01] [INFO ] Redundant transitions in 151 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 95, 96, 98, 102, 105, 106, 107, 113, 114, 115, 117, 121, 124, 125, 127, 130, 131, 134, 142]
Found 32 redundant transitions using SMT.
Drop transitions removed 32 transitions
Redundant transitions reduction (with SMT) removed 32 transitions.
// Phase 1: matrix 114 rows 116 cols
[2022-05-19 17:22:01] [INFO ] Computed 48 place invariants in 1 ms
[2022-05-19 17:22:02] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/215 places, 114/245 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 116 transition count 103
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 94 transition count 103
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 38 place count 94 transition count 98
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 44 edges and 84 vertex of which 12 / 84 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 78 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 60 place count 78 transition count 87
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 87 place count 60 transition count 78
Graph (trivial) has 38 edges and 60 vertex of which 18 / 60 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 51 transition count 78
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 97 place count 51 transition count 69
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 112 place count 51 transition count 54
Applied a total of 112 rules in 31 ms. Remains 51 /116 variables (removed 65) and now considering 54/114 (removed 60) transitions.
// Phase 1: matrix 54 rows 51 cols
[2022-05-19 17:22:02] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 17:22:02] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 54 rows 51 cols
[2022-05-19 17:22:02] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 17:22:02] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 51/215 places, 54/245 transitions.
Finished structural reductions, in 2 iterations. Remains : 51/215 places, 54/245 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s49 1)), p0:(AND (EQ s13 1) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-12 finished in 1116 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(G(X(((p0 U (p1 U p0))||X(p1))))))))'
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 245
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 195 transition count 225
Ensure Unique test removed 8 places
Iterating global reduction 1 with 25 rules applied. Total rules applied 45 place count 187 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 54 place count 187 transition count 216
Applied a total of 54 rules in 10 ms. Remains 187 /215 variables (removed 28) and now considering 216/245 (removed 29) transitions.
[2022-05-19 17:22:02] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2022-05-19 17:22:02] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:22:02] [INFO ] Implicit Places using invariants in 202 ms returned []
[2022-05-19 17:22:02] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2022-05-19 17:22:02] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:22:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:22:03] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 569 ms to find 0 implicit places.
[2022-05-19 17:22:03] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 187 cols
[2022-05-19 17:22:03] [INFO ] Computed 58 place invariants in 9 ms
[2022-05-19 17:22:03] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/215 places, 216/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 187/215 places, 216/245 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s87 1) (EQ s96 1)), p1:(AND (EQ s84 1) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-13 finished in 1016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(((p1 U p2)||p0)))&&F(G(p3)))))'
Support contains 6 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 245
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 18 place count 197 transition count 228
Ensure Unique test removed 8 places
Iterating global reduction 1 with 23 rules applied. Total rules applied 41 place count 189 transition count 228
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 50 place count 189 transition count 219
Applied a total of 50 rules in 8 ms. Remains 189 /215 variables (removed 26) and now considering 219/245 (removed 26) transitions.
[2022-05-19 17:22:03] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 189 cols
[2022-05-19 17:22:03] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:22:03] [INFO ] Implicit Places using invariants in 203 ms returned []
[2022-05-19 17:22:03] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 189 cols
[2022-05-19 17:22:03] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:22:04] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2022-05-19 17:22:04] [INFO ] Flow matrix only has 210 transitions (discarded 9 similar events)
// Phase 1: matrix 210 rows 189 cols
[2022-05-19 17:22:04] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-19 17:22:04] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/215 places, 219/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/215 places, 219/245 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p3)]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s182 0)), p2:(AND (EQ s158 1) (EQ s182 1) (EQ s25 1) (EQ s32 1)), p3:(AND (EQ s51 1) (EQ s115 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-14 finished in 1324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&(G(p1)||G(p2)||X(F(p3))))))'
Support contains 6 out of 215 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 215/215 places, 245/245 transitions.
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 211 transition count 245
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 19 place count 196 transition count 228
Ensure Unique test removed 7 places
Iterating global reduction 1 with 22 rules applied. Total rules applied 41 place count 189 transition count 228
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 49 place count 189 transition count 220
Applied a total of 49 rules in 9 ms. Remains 189 /215 variables (removed 26) and now considering 220/245 (removed 25) transitions.
[2022-05-19 17:22:04] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2022-05-19 17:22:04] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:04] [INFO ] Implicit Places using invariants in 170 ms returned []
[2022-05-19 17:22:05] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2022-05-19 17:22:05] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-19 17:22:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-19 17:22:05] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2022-05-19 17:22:05] [INFO ] Flow matrix only has 211 transitions (discarded 9 similar events)
// Phase 1: matrix 211 rows 189 cols
[2022-05-19 17:22:05] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-19 17:22:05] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/215 places, 220/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 189/215 places, 220/245 transitions.
Stuttering acceptance computed with spot in 526 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-3A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=1 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(OR (EQ s17 0) (EQ s35 0)), p2:(OR (EQ s87 0) (EQ s101 0)), p3:(AND (EQ s87 1) (EQ s101 1)), p0:(AND (EQ s115 1) (EQ s126 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 736 ms.
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-3A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-3A-LTLFireability-15 finished in 2125 ms.
All properties solved by simple procedures.
Total runtime 19403 ms.

BK_STOP 1652980927308

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-3A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-3A, 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 r150-smll-165276998400148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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