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.r389-oct2-167903713300219.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldIIPt-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713300219
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 50K 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 ShieldIIPt-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679183224145

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-18 23:47:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 23:47:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 23:47:06] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2023-03-18 23:47:06] [INFO ] Transformed 213 places.
[2023-03-18 23:47:06] [INFO ] Transformed 198 transitions.
[2023-03-18 23:47:06] [INFO ] Found NUPN structural information;
[2023-03-18 23:47:06] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 184 transition count 169
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 184 transition count 169
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 183 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 167
Applied a total of 62 rules in 54 ms. Remains 182 /213 variables (removed 31) and now considering 167/198 (removed 31) transitions.
// Phase 1: matrix 167 rows 182 cols
[2023-03-18 23:47:06] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-18 23:47:07] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-03-18 23:47:07] [INFO ] Invariant cache hit.
[2023-03-18 23:47:07] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 750 ms to find 0 implicit places.
[2023-03-18 23:47:07] [INFO ] Invariant cache hit.
[2023-03-18 23:47:07] [INFO ] Dead Transitions using invariants and state equation in 308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/213 places, 167/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1112 ms. Remains : 182/213 places, 167/198 transitions.
Support contains 16 out of 182 places after structural reductions.
[2023-03-18 23:47:08] [INFO ] Flatten gal took : 34 ms
[2023-03-18 23:47:08] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:47:08] [INFO ] Input system was already deterministic with 167 transitions.
Finished random walk after 238 steps, including 0 resets, run visited all 10 properties in 30 ms. (steps per millisecond=7 )
Computed a total of 46 stabilizing places and 46 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 180 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 180 transition count 165
Applied a total of 4 rules in 23 ms. Remains 180 /182 variables (removed 2) and now considering 165/167 (removed 2) transitions.
// Phase 1: matrix 165 rows 180 cols
[2023-03-18 23:47:08] [INFO ] Computed 28 place invariants in 5 ms
[2023-03-18 23:47:08] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-18 23:47:08] [INFO ] Invariant cache hit.
[2023-03-18 23:47:09] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2023-03-18 23:47:09] [INFO ] Invariant cache hit.
[2023-03-18 23:47:09] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/182 places, 165/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 180/182 places, 165/167 transitions.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s155 0) (EQ s48 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-02 finished in 1280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 3 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 181 transition count 132
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 147 transition count 132
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 68 place count 147 transition count 110
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 112 place count 125 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 124 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 124 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 114 place count 124 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 123 transition count 108
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 220 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 71 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 239 place count 62 transition count 58
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 60 transition count 56
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 58 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 243 place count 58 transition count 55
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 245 place count 57 transition count 55
Applied a total of 245 rules in 62 ms. Remains 57 /182 variables (removed 125) and now considering 55/167 (removed 112) transitions.
// Phase 1: matrix 55 rows 57 cols
[2023-03-18 23:47:09] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-18 23:47:09] [INFO ] Implicit Places using invariants in 66 ms returned [44]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/182 places, 55/167 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 2 place count 55 transition count 54
Applied a total of 2 rules in 3 ms. Remains 55 /56 variables (removed 1) and now considering 54/55 (removed 1) transitions.
// Phase 1: matrix 54 rows 55 cols
[2023-03-18 23:47:09] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-18 23:47:09] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-18 23:47:09] [INFO ] Invariant cache hit.
[2023-03-18 23:47:09] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/182 places, 54/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 252 ms. Remains : 55/182 places, 54/167 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s48 0) (EQ s15 1)), p1:(EQ s51 0)], nbAcceptance=1, 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 18 steps with 1 reset in 0 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-07 finished in 418 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 179 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 179 transition count 164
Applied a total of 6 rules in 12 ms. Remains 179 /182 variables (removed 3) and now considering 164/167 (removed 3) transitions.
// Phase 1: matrix 164 rows 179 cols
[2023-03-18 23:47:09] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-18 23:47:10] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-18 23:47:10] [INFO ] Invariant cache hit.
[2023-03-18 23:47:10] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-18 23:47:10] [INFO ] Invariant cache hit.
[2023-03-18 23:47:10] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/182 places, 164/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 179/182 places, 164/167 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-08 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 s172 0) (EQ s39 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]]
Product exploration explored 100000 steps with 68 reset in 376 ms.
Stack based approach found an accepted trace after 2952 steps with 78 reset with depth 499 and stack size 499 in 8 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-08 finished in 781 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 178 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 178 transition count 163
Applied a total of 8 rules in 26 ms. Remains 178 /182 variables (removed 4) and now considering 163/167 (removed 4) transitions.
// Phase 1: matrix 163 rows 178 cols
[2023-03-18 23:47:10] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-18 23:47:11] [INFO ] Invariant cache hit.
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-18 23:47:11] [INFO ] Invariant cache hit.
[2023-03-18 23:47:11] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/182 places, 163/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 178/182 places, 163/167 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-09 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 s170 0) (EQ s26 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]]
Product exploration explored 100000 steps with 351 reset in 192 ms.
Stack based approach found an accepted trace after 995 steps with 3 reset with depth 94 and stack size 94 in 3 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-09 finished in 943 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 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 181 transition count 132
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 147 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 146 transition count 131
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 70 place count 146 transition count 108
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 116 place count 123 transition count 108
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 121 transition count 106
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 121 transition count 106
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 120 place count 121 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 220 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 221 place count 71 transition count 55
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 4 with 2 rules applied. Total rules applied 223 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 239 place count 62 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 60 transition count 57
Applied a total of 241 rules in 30 ms. Remains 60 /182 variables (removed 122) and now considering 57/167 (removed 110) transitions.
// Phase 1: matrix 57 rows 60 cols
[2023-03-18 23:47:11] [INFO ] Computed 28 place invariants in 2 ms
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants in 45 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/182 places, 57/167 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 59 transition count 56
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 2 place count 58 transition count 56
Applied a total of 2 rules in 3 ms. Remains 58 /59 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 58 cols
[2023-03-18 23:47:11] [INFO ] Computed 27 place invariants in 0 ms
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants in 45 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 57/182 places, 56/167 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 2 place count 56 transition count 55
Applied a total of 2 rules in 2 ms. Remains 56 /57 variables (removed 1) and now considering 55/56 (removed 1) transitions.
// Phase 1: matrix 55 rows 56 cols
[2023-03-18 23:47:11] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-18 23:47:11] [INFO ] Invariant cache hit.
[2023-03-18 23:47:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 23:47:11] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 56/182 places, 55/167 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 268 ms. Remains : 56/182 places, 55/167 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-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 s12 0) (EQ s49 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 34 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-12 finished in 389 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)||G((p1 U X(p2)))||G(p3))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 178 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 178 transition count 163
Applied a total of 8 rules in 4 ms. Remains 178 /182 variables (removed 4) and now considering 163/167 (removed 4) transitions.
// Phase 1: matrix 163 rows 178 cols
[2023-03-18 23:47:12] [INFO ] Computed 28 place invariants in 4 ms
[2023-03-18 23:47:12] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-18 23:47:12] [INFO ] Invariant cache hit.
[2023-03-18 23:47:12] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-18 23:47:12] [INFO ] Invariant cache hit.
[2023-03-18 23:47:12] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/182 places, 163/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 178/182 places, 163/167 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 p3 p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s70 0), p3:(AND (EQ s30 0) (EQ s130 1)), p1:(OR (EQ s37 0) (EQ s55 1)), p2:(OR (EQ s130 0) (EQ s30 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33198 reset in 253 ms.
Product exploration explored 100000 steps with 33256 reset in 324 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 50 factoid took 4471 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 24) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 13) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-18 23:47:18] [INFO ] Invariant cache hit.
[2023-03-18 23:47:19] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 23:47:19] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-18 23:47:19] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (G (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) p0 (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p3) p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p3 p0 (NOT p1))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (NOT (AND (NOT p3) p0))), (F (AND p3 (NOT p0))), (F (AND p3 (NOT p0) p1 (NOT p2))), (F (AND p3 p0 p1 (NOT p2))), (F (AND p3 p0 p1)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) p1)), (F (AND p3 (NOT p0) (NOT p2))), (F (AND p3 p0 (NOT p2))), (F (AND p3 (NOT p0) (NOT p1) (NOT p2))), (F (AND p3 p0 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p0) p1)), (F (NOT (AND (NOT p3) p0 p1)))]
Knowledge based reduction with 56 factoid took 4966 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-18 23:47:24] [INFO ] Invariant cache hit.
[2023-03-18 23:47:24] [INFO ] Implicit Places using invariants in 255 ms returned []
[2023-03-18 23:47:24] [INFO ] Invariant cache hit.
[2023-03-18 23:47:25] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-18 23:47:25] [INFO ] Invariant cache hit.
[2023-03-18 23:47:25] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 178/178 places, 163/163 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 38 factoid took 2520 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 18) seen :11
Finished Best-First random walk after 4168 steps, including 1 resets, run visited all 7 properties in 16 ms. (steps per millisecond=260 )
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND p1 p0 p3))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3))), (X (AND p1 p0 (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) p3))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND p1 p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p3)))), (X (X (AND p1 p0 (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p3 p0 p1)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND p3 (NOT p0) p1)), (F (AND p3 p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p3) p0 (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p3 (NOT p0) (NOT p1))), (F (AND p3 p0)), (F (NOT (AND (NOT p3) p0))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2))), (F (AND p3 (NOT p0))), (F (AND (NOT p3) (NOT p0) p1)), (F (NOT (AND (NOT p3) p0 p1)))]
Knowledge based reduction with 38 factoid took 3128 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33333 reset in 260 ms.
Product exploration explored 100000 steps with 33371 reset in 235 ms.
Built C files in :
/tmp/ltsmin17632693632735464716
[2023-03-18 23:47:32] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17632693632735464716
Running compilation step : cd /tmp/ltsmin17632693632735464716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 464 ms.
Running link step : cd /tmp/ltsmin17632693632735464716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17632693632735464716;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased167641612635367924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 1 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2023-03-18 23:47:48] [INFO ] Invariant cache hit.
[2023-03-18 23:47:48] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 23:47:48] [INFO ] Invariant cache hit.
[2023-03-18 23:47:48] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-18 23:47:48] [INFO ] Invariant cache hit.
[2023-03-18 23:47:48] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 178/178 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin9496013386760913765
[2023-03-18 23:47:48] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9496013386760913765
Running compilation step : cd /tmp/ltsmin9496013386760913765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin9496013386760913765;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin9496013386760913765;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11096442968353495837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 23:48:03] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:48:03] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:48:03] [INFO ] Time to serialize gal into /tmp/LTL8447658377225644861.gal : 7 ms
[2023-03-18 23:48:03] [INFO ] Time to serialize properties into /tmp/LTL4819920880283292154.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8447658377225644861.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2134002486724140182.hoa' '-atoms' '/tmp/LTL4819920880283292154.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4819920880283292154.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2134002486724140182.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t16, t20, t25, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...405
Computing Next relation with stutter on 416 deadlock states
Detected timeout of ITS tools.
[2023-03-18 23:48:18] [INFO ] Flatten gal took : 19 ms
[2023-03-18 23:48:18] [INFO ] Flatten gal took : 13 ms
[2023-03-18 23:48:18] [INFO ] Time to serialize gal into /tmp/LTL9741516946350713225.gal : 4 ms
[2023-03-18 23:48:18] [INFO ] Time to serialize properties into /tmp/LTL3250732429591424648.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9741516946350713225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3250732429591424648.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(((G("(p81==0)"))||(G(("((p39==0)||(p63==1))")U(X("((p152==0)||(p30==1))")))))||(G("((p30==0)&&(p152==1))")))))
Formula 0 simplified : G(F!"(p81==0)" & F(!"((p39==0)||(p63==1))" R X!"((p152==0)||(p30==1))") & F!"((p30==0)&&(p152==1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t16, t20, t25, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...405
Computing Next relation with stutter on 416 deadlock states
Detected timeout of ITS tools.
[2023-03-18 23:48:33] [INFO ] Flatten gal took : 7 ms
[2023-03-18 23:48:33] [INFO ] Applying decomposition
[2023-03-18 23:48:33] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13233532420948354484.txt' '-o' '/tmp/graph13233532420948354484.bin' '-w' '/tmp/graph13233532420948354484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13233532420948354484.bin' '-l' '-1' '-v' '-w' '/tmp/graph13233532420948354484.weights' '-q' '0' '-e' '0.001'
[2023-03-18 23:48:33] [INFO ] Decomposing Gal with order
[2023-03-18 23:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 23:48:33] [INFO ] Removed a total of 33 redundant transitions.
[2023-03-18 23:48:33] [INFO ] Flatten gal took : 57 ms
[2023-03-18 23:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-18 23:48:33] [INFO ] Time to serialize gal into /tmp/LTL11001669180485690764.gal : 4 ms
[2023-03-18 23:48:33] [INFO ] Time to serialize properties into /tmp/LTL4334419475861078443.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11001669180485690764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4334419475861078443.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((G("(i7.i0.u27.p81==0)"))||(G(("((i3.u12.p39==0)||(i4.u20.p63==1))")U(X("((i12.u50.p152==0)||(i3.u13.p30==1))")))))||(G("((i3.u1...190
Formula 0 simplified : G(F!"(i7.i0.u27.p81==0)" & F(!"((i3.u12.p39==0)||(i4.u20.p63==1))" R X!"((i12.u50.p152==0)||(i3.u13.p30==1))") & F!"((i3.u13.p30==0)...177
Reverse transition relation is NOT exact ! Due to transitions t43, t83, t133, i0.i0.u1.t137, i1.t129, i1.i0.t131, i1.i0.u6.t136, i1.i0.u9.t132, i1.i1.u10.t...684
Computing Next relation with stutter on 416 deadlock states
133 unique states visited
50 strongly connected components in search stack
313 transitions explored
67 items max in DFS search stack
907 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,9.10843,375376,1,0,801425,453,2825,1.05472e+06,237,1426,1117272
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 93229 ms.
All properties solved by simple procedures.
Total runtime 98918 ms.

BK_STOP 1679183325607

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="LTLCardinality"
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-5348"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-003B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713300219"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003B.tgz
mv ShieldIIPt-PT-003B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;