Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162298996000125.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 Philosophers-PT-000050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298996000125
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 434K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 638K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 99K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Mar 25 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 25 08:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 216K May 5 16:51 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 Philosophers-PT-000050-00
FORMULA_NAME Philosophers-PT-000050-01
FORMULA_NAME Philosophers-PT-000050-02
FORMULA_NAME Philosophers-PT-000050-03
FORMULA_NAME Philosophers-PT-000050-04
FORMULA_NAME Philosophers-PT-000050-05
FORMULA_NAME Philosophers-PT-000050-06
FORMULA_NAME Philosophers-PT-000050-07
FORMULA_NAME Philosophers-PT-000050-08
FORMULA_NAME Philosophers-PT-000050-09
FORMULA_NAME Philosophers-PT-000050-10
FORMULA_NAME Philosophers-PT-000050-11
FORMULA_NAME Philosophers-PT-000050-12
FORMULA_NAME Philosophers-PT-000050-13
FORMULA_NAME Philosophers-PT-000050-14
FORMULA_NAME Philosophers-PT-000050-15

=== Now, execution of the tool begins

BK_START 1622990119756

Running Version 0
[2021-06-06 14:35:21] [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]
[2021-06-06 14:35:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:35:21] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2021-06-06 14:35:21] [INFO ] Transformed 250 places.
[2021-06-06 14:35:21] [INFO ] Transformed 250 transitions.
[2021-06-06 14:35:21] [INFO ] Found NUPN structural information;
[2021-06-06 14:35:21] [INFO ] Parsed PT model containing 250 places and 250 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 14:35:21] [INFO ] Initial state test concluded for 1 properties.
FORMULA Philosophers-PT-000050-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:21] [INFO ] Computed 100 place invariants in 20 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants in 200 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:22] [INFO ] Computed 100 place invariants in 7 ms
[2021-06-06 14:35:22] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:22] [INFO ] Computed 100 place invariants in 5 ms
[2021-06-06 14:35:22] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
[2021-06-06 14:35:22] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-06-06 14:35:22] [INFO ] Flatten gal took : 74 ms
FORMULA Philosophers-PT-000050-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 14:35:23] [INFO ] Flatten gal took : 27 ms
[2021-06-06 14:35:23] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 2816 steps, including 1 resets, run visited all 19 properties in 29 ms. (steps per millisecond=97 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&F(p1)) U (p2 U (G(p2)||(F(p0)&&p3)))))], workingDir=/home/mcc/execution]
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 21 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 4 ms
[2021-06-06 14:35:23] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 4 ms
[2021-06-06 14:35:23] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2021-06-06 14:35:23] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:23] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:23] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 375 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), true, (NOT p1), (NOT p0), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000050-00 automaton TGBA [mat=[[{ cond=(AND (NOT p3) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (OR (NEQ s82 1) (NEQ s136 1)) (OR (NEQ s88 1) (NEQ s149 1)) (OR (NEQ s76 1) (NEQ s119 1)) (OR (NEQ s66 1) (NEQ s113 1)) (OR (NEQ s56 1) (NEQ s105 1)) (OR (NEQ s77 1) (NEQ s139 1)) (OR (NEQ s90 1) (NEQ s128 1)) (OR (NEQ s54 1) (NEQ s103 1)) (OR (NEQ s49 1) (NEQ s108 1)) (OR (NEQ s97 1) (NEQ s153 1)) (OR (NEQ s57 1) (NEQ s115 1)) (OR (NEQ s69 1) (NEQ s118 1)) (OR (NEQ s73 1) (NEQ s122 1)) (OR (NEQ s61 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s131 1)) (OR (NEQ s68 1) (NEQ s111 1)) (OR (NEQ s74 1) (NEQ s121 1)) (OR (NEQ s99 1) (NEQ s151 1)) (OR (NEQ s80 1) (NEQ s126 1)) (OR (NEQ s71 1) (NEQ s134 1)) (OR (NEQ s83 1) (NEQ s137 1)) (OR (NEQ s63 1) (NEQ s124 1)) (OR (NEQ s78 1) (NEQ s140 1)) (OR (NEQ s55 1) (NEQ s106 1)) (OR (NEQ s72 1) (NEQ s133 1)) (OR (NEQ s98 1) (NEQ s154 1)) (OR (NEQ s60 1) (NEQ s101 1)) (OR (NEQ s91 1) (NEQ s129 1)) (OR (NEQ s86 1) (NEQ s132 1)) (OR (NEQ s50 1) (NEQ s107 1)) (OR (NEQ s70 1) (NEQ s117 1)) (OR (NEQ s87 1) (NEQ s150 1)) (OR (NEQ s81 1) (NEQ s135 1)) (OR (NEQ s65 1) (NEQ s114 1)) (OR (NEQ s53 1) (NEQ s104 1)) (OR (NEQ s96 1) (NEQ s156 1)) (OR (NEQ s93 1) (NEQ s141 1)) (OR (NEQ s100 1) (NEQ s152 1)) (OR (NEQ s89 1) (NEQ s127 1)) (OR (NEQ s58 1) (NEQ s116 1)) (OR (NEQ s64 1) (NEQ s123 1)) (OR (NEQ s95 1) (NEQ s155 1)) (OR (NEQ s84 1) (NEQ s138 1)) (OR (NEQ s62 1) (NEQ s109 1)) (OR (NEQ s51 1) (NEQ s94 1)) (OR (NEQ s75 1) (NEQ s120 1)) (OR (NEQ s67 1) (NEQ s112 1)) (OR (NEQ s59 1) (NEQ s102 1)) (OR (NEQ s92 1) (NEQ s130 1)) (OR (NEQ s79 1) (NEQ s125 1))), p0:(OR (AND (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (AND (EQ s86 1) (EQ s131 1)) (AND (EQ s96 1) (EQ s141 1)) (AND (EQ s87 1) (EQ s151 1)) (AND (EQ s81 1) (EQ s138 1)) (AND (EQ s65 1) (EQ s113 1)) (AND (EQ s53 1) (EQ s101 1)) (AND (EQ s72 1) (EQ s136 1)) (AND (EQ s58 1) (EQ s115 1)) (AND (EQ s100 1) (EQ s153 1)) (AND (EQ s64 1) (EQ s122 1)) (AND (EQ s89 1) (EQ s130 1)) (AND (EQ s95 1) (EQ s156 1)) (AND (EQ s84 1) (EQ s137 1)) (AND (EQ s75 1) (EQ s119 1)) (AND (EQ s67 1) (EQ s111 1)) (AND (EQ s62 1) (EQ s124 1)) (AND (EQ s92 1) (EQ s129 1)) (AND (EQ s51 1) (EQ s107 1)) (AND (EQ s70 1) (EQ s134 1)) (AND (EQ s79 1) (EQ s128 1)) (AND (EQ s88 1) (EQ s150 1)) (AND (EQ s82 1) (EQ s135 1)) (AND (EQ s76 1) (EQ s118 1)) (AND (EQ s66 1) (EQ s112 1)) (AND (EQ s56 1) (EQ s106 1)) (AND (EQ s93 1) (EQ s94 1)) (AND (EQ s57 1) (EQ s114 1)) (AND (EQ s54 1) (EQ s104 1)) (AND (EQ s90 1) (EQ s127 1)) (AND (EQ s49 1) (EQ s105 1)) (AND (EQ s97 1) (EQ s154 1)) (AND (EQ s61 1) (EQ s109 1)) (AND (EQ s69 1) (EQ s117 1)) (AND (EQ s73 1) (EQ s121 1)) (AND (EQ s77 1) (EQ s126 1)) (AND (EQ s68 1) (EQ s110 1)) (AND (EQ s74 1) (EQ s120 1)) (AND (EQ s85 1) (EQ s149 1)) (AND (EQ s99 1) (EQ s152 1)) (AND (EQ s71 1) (EQ s133 1)) (AND (EQ s80 1) (EQ s125 1)) (AND (EQ s63 1) (EQ s123 1)) (AND (EQ s83 1) (EQ s140 1)) (AND (EQ s59 1) (EQ s116 1)) (AND (EQ s78 1) (EQ s139 1))), p2:(AND (OR (NEQ s82 1) (NEQ s136 1)) (OR (NEQ s88 1) (NEQ s149 1)) (OR (NEQ s76 1) (NEQ s119 1)) (OR (NEQ s66 1) (NEQ s113 1)) (OR (NEQ s56 1) (NEQ s105 1)) (OR (NEQ s77 1) (NEQ s139 1)) (OR (NEQ s90 1) (NEQ s128 1)) (OR (NEQ s54 1) (NEQ s103 1)) (OR (NEQ s49 1) (NEQ s108 1)) (OR (NEQ s97 1) (NEQ s153 1)) (OR (NEQ s57 1) (NEQ s115 1)) (OR (NEQ s69 1) (NEQ s118 1)) (OR (NEQ s73 1) (NEQ s122 1)) (OR (NEQ s61 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s131 1)) (OR (NEQ s68 1) (NEQ s111 1)) (OR (NEQ s74 1) (NEQ s121 1)) (OR (NEQ s99 1) (NEQ s151 1)) (OR (NEQ s80 1) (NEQ s126 1)) (OR (NEQ s71 1) (NEQ s134 1)) (OR (NEQ s83 1) (NEQ s137 1)) (OR (NEQ s63 1) (NEQ s124 1)) (OR (NEQ s78 1) (NEQ s140 1)) (OR (NEQ s55 1) (NEQ s106 1)) (OR (NEQ s72 1) (NEQ s133 1)) (OR (NEQ s98 1) (NEQ s154 1)) (OR (NEQ s60 1) (NEQ s101 1)) (OR (NEQ s91 1) (NEQ s129 1)) (OR (NEQ s86 1) (NEQ s132 1)) (OR (NEQ s50 1) (NEQ s107 1)) (OR (NEQ s70 1) (NEQ s117 1)) (OR (NEQ s87 1) (NEQ s150 1)) (OR (NEQ s81 1) (NEQ s135 1)) (OR (NEQ s65 1) (NEQ s114 1)) (OR (NEQ s53 1) (NEQ s104 1)) (OR (NEQ s96 1) (NEQ s156 1)) (OR (NEQ s93 1) (NEQ s141 1)) (OR (NEQ s100 1) (NEQ s152 1)) (OR (NEQ s89 1) (NEQ s127 1)) (OR (NEQ s58 1) (NEQ s116 1)) (OR (NEQ s64 1) (NEQ s123 1)) (OR (NEQ s95 1) (NEQ s155 1)) (OR (NEQ s84 1) (NEQ s138 1)) (OR (NEQ s62 1) (NEQ s109 1)) (OR (NEQ s51 1) (NEQ s94 1)) (OR (NEQ s75 1) (NEQ s120 1)) (OR (NEQ s67 1) (NEQ s112 1)) (OR (NEQ s59 1) (NEQ s102 1)) (OR (NEQ s92 1) (NEQ s130 1)) (OR (NEQ s79 1) (NEQ s125 1))), p1:(OR (AND (EQ s68 1) (EQ s210 1)) (AND (EQ s59 1) (EQ s220 1)) (AND (EQ s73 1) (EQ s207 1)) (AND (EQ s69 1) (EQ s234 1)) (AND (EQ s85 1) (EQ s247 1)) (AND (EQ s80 1) (EQ s224 1)) (AND (EQ s51 1) (EQ s195 1)) (AND (EQ s78 1) (EQ s226 1)) (AND (EQ s56 1) (EQ s192 1)) (AND (EQ s63 1) (EQ s205 1)) (AND (EQ s83 1) (EQ s227 1)) (AND (EQ s54 1) (EQ s217 1)) (AND (EQ s99 1) (EQ s242 1)) (AND (EQ s66 1) (EQ s216 1)) (AND (EQ s61 1) (EQ s211 1)) (AND (EQ s82 1) (EQ s230 1)) (AND (EQ s50 1) (EQ s190 1)) (AND (EQ s55 1) (EQ s191 1)) (AND (EQ s71 1) (EQ s232 1)) (AND (EQ s76 1) (EQ s235 1)) (AND (EQ s74 1) (EQ s208 1)) (AND (EQ s60 1) (EQ s219 1)) (AND (EQ s57 1) (EQ s214 1)) (AND (EQ s90 1) (EQ s222 1)) (AND (EQ s77 1) (EQ s225 1)) (AND (EQ s88 1) (EQ s244 1)) (AND (EQ s93 1) (EQ s237 1)) (AND (EQ s97 1) (EQ s240 1)) (AND (EQ s84 1) (EQ s228 1)) (AND (EQ s58 1) (EQ s213 1)) (AND (EQ s89 1) (EQ s221 1)) (AND (EQ s53 1) (EQ s218 1)) (AND (EQ s100 1) (EQ s243 1)) (AND (EQ s75 1) (EQ s236 1)) (AND (EQ s91 1) (EQ s249 1)) (AND (EQ s62 1) (EQ s212 1)) (AND (EQ s64 1) (EQ s206 1)) (AND (EQ s86 1) (EQ s246 1)) (AND (EQ s70 1) (EQ s233 1)) (AND (EQ s67 1) (EQ s209 1)) (AND (EQ s95 1) (EQ s238 1)) (AND (EQ s79 1) (EQ s223 1)) (AND (EQ s72 1) (EQ s231 1)) (AND (EQ s49 1) (EQ s189 1)) (AND (EQ s96 1) (EQ s239 1)) (AND (EQ s87 1) (EQ s245 1)) (AND (EQ s98 1) (EQ s241 1)) (AND (EQ s65 1) (EQ s215 1)) (AND (EQ s81 1) (EQ s229 1)) (AND (EQ s92 1) (EQ s248 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1433 steps with 39 reset in 40 ms.
FORMULA Philosophers-PT-000050-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-00 finished in 930 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(F(p0)) U !p1))))], workingDir=/home/mcc/execution]
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:24] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:24] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:24] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:24] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2021-06-06 14:35:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:24] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:24] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 142 ms :[p1, (AND p1 (NOT p0)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-PT-000050-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (NEQ s82 1) (NEQ s136 1)) (OR (NEQ s88 1) (NEQ s149 1)) (OR (NEQ s76 1) (NEQ s119 1)) (OR (NEQ s66 1) (NEQ s113 1)) (OR (NEQ s56 1) (NEQ s105 1)) (OR (NEQ s77 1) (NEQ s139 1)) (OR (NEQ s90 1) (NEQ s128 1)) (OR (NEQ s54 1) (NEQ s103 1)) (OR (NEQ s49 1) (NEQ s108 1)) (OR (NEQ s97 1) (NEQ s153 1)) (OR (NEQ s57 1) (NEQ s115 1)) (OR (NEQ s69 1) (NEQ s118 1)) (OR (NEQ s73 1) (NEQ s122 1)) (OR (NEQ s61 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s131 1)) (OR (NEQ s68 1) (NEQ s111 1)) (OR (NEQ s74 1) (NEQ s121 1)) (OR (NEQ s99 1) (NEQ s151 1)) (OR (NEQ s80 1) (NEQ s126 1)) (OR (NEQ s71 1) (NEQ s134 1)) (OR (NEQ s83 1) (NEQ s137 1)) (OR (NEQ s63 1) (NEQ s124 1)) (OR (NEQ s78 1) (NEQ s140 1)) (OR (NEQ s55 1) (NEQ s106 1)) (OR (NEQ s72 1) (NEQ s133 1)) (OR (NEQ s98 1) (NEQ s154 1)) (OR (NEQ s60 1) (NEQ s101 1)) (OR (NEQ s91 1) (NEQ s129 1)) (OR (NEQ s86 1) (NEQ s132 1)) (OR (NEQ s50 1) (NEQ s107 1)) (OR (NEQ s70 1) (NEQ s117 1)) (OR (NEQ s87 1) (NEQ s150 1)) (OR (NEQ s81 1) (NEQ s135 1)) (OR (NEQ s65 1) (NEQ s114 1)) (OR (NEQ s53 1) (NEQ s104 1)) (OR (NEQ s96 1) (NEQ s156 1)) (OR (NEQ s93 1) (NEQ s141 1)) (OR (NEQ s100 1) (NEQ s152 1)) (OR (NEQ s89 1) (NEQ s127 1)) (OR (NEQ s58 1) (NEQ s116 1)) (OR (NEQ s64 1) (NEQ s123 1)) (OR (NEQ s95 1) (NEQ s155 1)) (OR (NEQ s84 1) (NEQ s138 1)) (OR (NEQ s62 1) (NEQ s109 1)) (OR (NEQ s51 1) (NEQ s94 1)) (OR (NEQ s75 1) (NEQ s120 1)) (OR (NEQ s67 1) (NEQ s112 1)) (OR (NEQ s59 1) (NEQ s102 1)) (OR (NEQ s92 1) (NEQ s130 1)) (OR (NEQ s79 1) (NEQ s125 1))), p0:(OR (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1) (EQ s29 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 292 reset in 591 ms.
Stuttering criterion allowed to conclude after 67468 steps with 189 reset in 411 ms.
FORMULA Philosophers-PT-000050-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-01 finished in 1590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 50 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 19 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:25] [INFO ] Computed 100 place invariants in 4 ms
[2021-06-06 14:35:25] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2021-06-06 14:35:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 6 ms
[2021-06-06 14:35:26] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1) (EQ s29 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s52 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 4724 steps with 0 reset in 20 ms.
FORMULA Philosophers-PT-000050-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-02 finished in 612 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(((p0&&X(p1)) U p2)))))], workingDir=/home/mcc/execution]
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 4 ms
[2021-06-06 14:35:26] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:26] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p2), (NOT p2), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000050-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (OR (AND (EQ s96 1) (EQ s196 1)) (AND (EQ s60 1) (EQ s167 1)) (AND (EQ s74 1) (EQ s162 1)) (AND (EQ s81 1) (EQ s185 1)) (AND (EQ s70 1) (EQ s181 1)) (AND (EQ s49 1) (EQ s145 1)) (AND (EQ s72 1) (EQ s187 1)) (AND (EQ s66 1) (EQ s170 1)) (AND (EQ s58 1) (EQ s165 1)) (AND (EQ s98 1) (EQ s194 1)) (AND (EQ s54 1) (EQ s148 1)) (AND (EQ s62 1) (EQ s158 1)) (AND (EQ s57 1) (EQ s172 1)) (AND (EQ s93 1) (EQ s142 1)) (AND (EQ s53 1) (EQ s168 1)) (AND (EQ s92 1) (EQ s178 1)) (AND (EQ s73 1) (EQ s163 1)) (AND (EQ s68 1) (EQ s160 1)) (AND (EQ s95 1) (EQ s193 1)) (AND (EQ s79 1) (EQ s179 1)) (AND (EQ s89 1) (EQ s177 1)) (AND (EQ s100 1) (EQ s200 1)) (AND (EQ s59 1) (EQ s166 1)) (AND (EQ s84 1) (EQ s186 1)) (AND (EQ s91 1) (EQ s202 1)) (AND (EQ s80 1) (EQ s174 1)) (AND (EQ s90 1) (EQ s180 1)) (AND (EQ s76 1) (EQ s183 1)) (AND (EQ s65 1) (EQ s171 1)) (AND (EQ s97 1) (EQ s199 1)) (AND (EQ s86 1) (EQ s201 1)) (AND (EQ s88 1) (EQ s203 1)) (AND (EQ s63 1) (EQ s157 1)) (AND (EQ s55 1) (EQ s147 1)) (AND (EQ s75 1) (EQ s161 1)) (AND (EQ s82 1) (EQ s188 1)) (AND (EQ s69 1) (EQ s184 1)) (AND (EQ s50 1) (EQ s144 1)) (AND (EQ s78 1) (EQ s176 1)) (AND (EQ s99 1) (EQ s197 1)) (AND (EQ s51 1) (EQ s143 1)) (AND (EQ s56 1) (EQ s146 1)) (AND (EQ s85 1) (EQ s204 1)) (AND (EQ s67 1) (EQ s169 1)) (AND (EQ s83 1) (EQ s175 1)) (AND (EQ s77 1) (EQ s173 1)) (AND (EQ s61 1) (EQ s159 1)) (AND (EQ s64 1) (EQ s164 1)) (AND (EQ s71 1) (EQ s182 1)) (AND (EQ s87 1) (EQ s198 1))) (OR (AND (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (AND (EQ s86 1) (EQ s131 1)) (AND (EQ s96 1) (EQ s141 1)) (AND (EQ s87 1) (EQ s151 1)) (AND (EQ s81 1) (EQ s138 1)) (AND (EQ s65 1) (EQ s113 1)) (AND (EQ s53 1) (EQ s101 1)) (AND (EQ s72 1) (EQ s136 1)) (AND (EQ s58 1) (EQ s115 1)) (AND (EQ s100 1) (EQ s153 1)) (AND (EQ s64 1) (EQ s122 1)) (AND (EQ s89 1) (EQ s130 1)) (AND (EQ s95 1) (EQ s156 1)) (AND (EQ s84 1) (EQ s137 1)) (AND (EQ s75 1) (EQ s119 1)) (AND (EQ s67 1) (EQ s111 1)) (AND (EQ s62 1) (EQ s124 1)) (AND (EQ s92 1) (EQ s129 1)) (AND (EQ s51 1) (EQ s107 1)) (AND (EQ s70 1) (EQ s134 1)) (AND (EQ s79 1) (EQ s128 1)) (AND (EQ s88 1) (EQ s150 1)) (AND (EQ s82 1) (EQ s135 1)) (AND (EQ s76 1) (EQ s118 1)) (AND (EQ s66 1) (EQ s112 1)) (AND (EQ s56 1) (EQ s106 1)) (AND (EQ s93 1) (EQ s94 1)) (AND (EQ s57 1) (EQ s114 1)) (AND (EQ s54 1) (EQ s104 1)) (AND (EQ s90 1) (EQ s127 1)) (AND (EQ s49 1) (EQ s105 1)) (AND (EQ s97 1) (EQ s154 1)) (AND (EQ s61 1) (EQ s109 1)) (AND (EQ s69 1) (EQ s117 1)) (AND (EQ s73 1) (EQ s121 1)) (AND (EQ s77 1) (EQ s126 1)) (AND (EQ s68 1) (EQ s110 1)) (AND (EQ s74 1) (EQ s120 1)) (AND (EQ s85 1) (EQ s149 1)) (AND (EQ s99 1) (EQ s152 1)) (AND (EQ s71 1) (EQ s133 1)) (AND (EQ s80 1) (EQ s125 1)) (AND (EQ s63 1) (EQ s123 1)) (AND (EQ s83 1) (EQ s140 1)) (AND (EQ s59 1) (EQ s116 1)) (AND (EQ s78 1) (EQ s139 1)))), p0:(OR (AND (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (AND (EQ s86 1) (EQ s131 1)) (AND (EQ s96 1) (EQ s141 1)) (AND (EQ s87 1) (EQ s151 1)) (AND (EQ s81 1) (EQ s138 1)) (AND (EQ s65 1) (EQ s113 1)) (AND (EQ s53 1) (EQ s101 1)) (AND (EQ s72 1) (EQ s136 1)) (AND (EQ s58 1) (EQ s115 1)) (AND (EQ s100 1) (EQ s153 1)) (AND (EQ s64 1) (EQ s122 1)) (AND (EQ s89 1) (EQ s130 1)) (AND (EQ s95 1) (EQ s156 1)) (AND (EQ s84 1) (EQ s137 1)) (AND (EQ s75 1) (EQ s119 1)) (AND (EQ s67 1) (EQ s111 1)) (AND (EQ s62 1) (EQ s124 1)) (AND (EQ s92 1) (EQ s129 1)) (AND (EQ s51 1) (EQ s107 1)) (AND (EQ s70 1) (EQ s134 1)) (AND (EQ s79 1) (EQ s128 1)) (AND (EQ s88 1) (EQ s150 1)) (AND (EQ s82 1) (EQ s135 1)) (AND (EQ s76 1) (EQ s118 1)) (AND (EQ s66 1) (EQ s112 1)) (AND (EQ s56 1) (EQ s106 1)) (AND (EQ s93 1) (EQ s94 1)) (AND (EQ s57 1) (EQ s114 1)) (AND (EQ s54 1) (EQ s104 1)) (AND (EQ s90 1) (EQ s127 1)) (AND (EQ s49 1) (EQ s105 1)) (AND (EQ s97 1) (EQ s154 1)) (AND (EQ s61 1) (EQ s109 1)) (AND (EQ s69 1) (EQ s117 1)) (AND (EQ s73 1) (EQ s121 1)) (AND (EQ s77 1) (EQ s126 1)) (AND (EQ s68 1) (EQ s110 1)) (AND (EQ s74 1) (EQ s120 1)) (AND (EQ s85 1) (EQ s149 1)) (AND (EQ s99 1) (EQ s152 1)) (AND (EQ s71 1) (EQ s133 1)) (AND (EQ s80 1) (EQ s125 1)) (AND (EQ s63 1) (EQ s123 1)) (AND (EQ s83 1) (EQ s140 1)) (AND (EQ s59 1) (EQ s116 1)) (AND (EQ s78 1) (EQ s139 1))), p1:(AND (OR (AND (EQ s96 1) (EQ s196 1)) (AND (EQ s60 1) (EQ s167 1)) (AND (EQ s74 1) (EQ s162 1)) (AND (EQ s81 1) (EQ s185 1)) (AND (EQ s70 1) (EQ s181 1)) (AND (EQ s49 1) (EQ s145 1)) (AND (EQ s72 1) (EQ s187 1)) (AND (EQ s66 1) (EQ s170 1)) (AND (EQ s58 1) (EQ s165 1)) (AND (EQ s98 1) (EQ s194 1)) (AND (EQ s54 1) (EQ s148 1)) (AND (EQ s62 1) (EQ s158 1)) (AND (EQ s57 1) (EQ s172 1)) (AND (EQ s93 1) (EQ s142 1)) (AND (EQ s53 1) (EQ s168 1)) (AND (EQ s92 1) (EQ s178 1)) (AND (EQ s73 1) (EQ s163 1)) (AND (EQ s68 1) (EQ s160 1)) (AND (EQ s95 1) (EQ s193 1)) (AND (EQ s79 1) (EQ s179 1)) (AND (EQ s89 1) (EQ s177 1)) (AND (EQ s100 1) (EQ s200 1)) (AND (EQ s59 1) (EQ s166 1)) (AND (EQ s84 1) (EQ s186 1)) (AND (EQ s91 1) (EQ s202 1)) (AND (EQ s80 1) (EQ s174 1)) (AND (EQ s90 1) (EQ s180 1)) (AND (EQ s76 1) (EQ s183 1)) (AND (EQ s65 1) (EQ s171 1)) (AND (EQ s97 1) (EQ s199 1)) (AND (EQ s86 1) (EQ s201 1)) (AND (EQ s88 1) (EQ s203 1)) (AND (EQ s63 1) (EQ s157 1)) (AND (EQ s55 1) (EQ s147 1)) (AND (EQ s75 1) (EQ s161 1)) (AND (EQ s82 1) (EQ s188 1)) (AND (EQ s69 1) (EQ s184 1)) (AND (EQ s50 1) (EQ s144 1)) (AND (EQ s78 1) (EQ s176 1)) (AND (EQ s99 1) (EQ s197 1)) (AND (EQ s51 1) (EQ s143 1)) (AND (EQ s56 1) (EQ s146 1)) (AND (EQ s85 1) (EQ s204 1)) (AND (EQ s67 1) (EQ s169 1)) (AND (EQ s83 1) (EQ s175 1)) (AND (EQ s77 1) (EQ s173 1)) (AND (EQ s61 1) (EQ s159 1)) (AND (EQ s64 1) (EQ s164 1)) (AND (EQ s71 1) (EQ s182 1)) (AND (EQ s87 1) (EQ s198 1))) (OR (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1) (EQ s29 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 148 steps with 0 reset in 6 ms.
FORMULA Philosophers-PT-000050-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-03 finished in 526 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U (!p1 U (p2 U p3))))))], workingDir=/home/mcc/execution]
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:26] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:27] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:27] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:27] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:27] [INFO ] Dead Transitions using invariants and state equation in 134 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Philosophers-PT-000050-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(AND (OR (EQ s98 0) (EQ s155 0)) (OR (EQ s55 0) (EQ s103 0)) (OR (EQ s60 0) (EQ s102 0)) (OR (EQ s91 0) (EQ s132 0)) (OR (EQ s50 0) (EQ s108 0)) (OR (EQ s86 0) (EQ s131 0)) (OR (EQ s96 0) (EQ s141 0)) (OR (EQ s87 0) (EQ s151 0)) (OR (EQ s81 0) (EQ s138 0)) (OR (EQ s65 0) (EQ s113 0)) (OR (EQ s53 0) (EQ s101 0)) (OR (EQ s72 0) (EQ s136 0)) (OR (EQ s58 0) (EQ s115 0)) (OR (EQ s100 0) (EQ s153 0)) (OR (EQ s64 0) (EQ s122 0)) (OR (EQ s89 0) (EQ s130 0)) (OR (EQ s95 0) (EQ s156 0)) (OR (EQ s84 0) (EQ s137 0)) (OR (EQ s75 0) (EQ s119 0)) (OR (EQ s67 0) (EQ s111 0)) (OR (EQ s62 0) (EQ s124 0)) (OR (EQ s92 0) (EQ s129 0)) (OR (EQ s51 0) (EQ s107 0)) (OR (EQ s70 0) (EQ s134 0)) (OR (EQ s79 0) (EQ s128 0)) (OR (EQ s88 0) (EQ s150 0)) (OR (EQ s82 0) (EQ s135 0)) (OR (EQ s76 0) (EQ s118 0)) (OR (EQ s66 0) (EQ s112 0)) (OR (EQ s56 0) (EQ s106 0)) (OR (EQ s93 0) (EQ s94 0)) (OR (EQ s57 0) (EQ s114 0)) (OR (EQ s54 0) (EQ s104 0)) (OR (EQ s90 0) (EQ s127 0)) (OR (EQ s49 0) (EQ s105 0)) (OR (EQ s97 0) (EQ s154 0)) (OR (EQ s61 0) (EQ s109 0)) (OR (EQ s69 0) (EQ s117 0)) (OR (EQ s73 0) (EQ s121 0)) (OR (EQ s77 0) (EQ s126 0)) (OR (EQ s68 0) (EQ s110 0)) (OR (EQ s74 0) (EQ s120 0)) (OR (EQ s85 0) (EQ s149 0)) (OR (EQ s99 0) (EQ s152 0)) (OR (EQ s71 0) (EQ s133 0)) (OR (EQ s80 0) (EQ s125 0)) (OR (EQ s63 0) (EQ s123 0)) (OR (EQ s83 0) (EQ s140 0)) (OR (EQ s59 0) (EQ s116 0)) (OR (EQ s78 0) (EQ s139 0))), p2:(OR (AND (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (AND (EQ s86 1) (EQ s131 1)) (AND (EQ s96 1) (EQ s141 1)) (AND (EQ s87 1) (EQ s151 1)) (AND (EQ s81 1) (EQ s138 1)) (AND (EQ s65 1) (EQ s113 1)) (AND (EQ s53 1) (EQ s101 1)) (AND (EQ s72 1) (EQ s136 1)) (AND (EQ s58 1) (EQ s115 1)) (AND (EQ s100 1) (EQ s153 1)) (AND (EQ s64 1) (EQ s122 1)) (AND (EQ s89 1) (EQ s130 1)) (AND (EQ s95 1) (EQ s156 1)) (AND (EQ s84 1) (EQ s137 1)) (AND (EQ s75 1) (EQ s119 1)) (AND (EQ s67 1) (EQ s111 1)) (AND (EQ s62 1) (EQ s124 1)) (AND (EQ s92 1) (EQ s129 1)) (AND (EQ s51 1) (EQ s107 1)) (AND (EQ s70 1) (EQ s134 1)) (AND (EQ s79 1) (EQ s128 1)) (AND (EQ s88 1) (EQ s150 1)) (AND (EQ s82 1) (EQ s135 1)) (AND (EQ s76 1) (EQ s118 1)) (AND (EQ s66 1) (EQ s112 1)) (AND (EQ s56 1) (EQ s106 1)) (AND (EQ s93 1) (EQ s94 1)) (AND (EQ s57 1) (EQ s114 1)) (AND (EQ s54 1) (EQ s104 1)) (AND (EQ s90 1) (EQ s127 1)) (AND (EQ s49 1) (EQ s105 1)) (AND (EQ s97 1) (EQ s154 1)) (AND (EQ s61 1) (EQ s109 1)) (AND (EQ s69 1) (EQ s117 1)) (AND (EQ s73 1) (EQ s121 1)) (AND (EQ s77 1) (EQ s126 1)) (AND (EQ s68 1) (EQ s110 1)) (AND (EQ s74 1) (EQ s120 1)) (AND (EQ s85 1) (EQ s149 1)) (AND (EQ s99 1) (EQ s152 1)) (AND (EQ s71 1) (EQ s133 1)) (AND (EQ s80 1) (EQ s125 1)) (AND (EQ s63 1) (EQ s123 1)) (AND (EQ s83 1) (EQ s140 1)) (AND (EQ s59 1) (EQ s116 1)) (AND (EQ s78 1) (EQ s139 1))), p1:(AND (OR (NEQ s82 1) (NEQ s136 1)) (OR (NEQ s88 1) (NEQ s149 1)) (OR (NEQ s76 1) (NEQ s119 1)) (OR (NEQ s66 1) (NEQ s113 1)) (OR (NEQ s56 1) (NEQ s105 1)) (OR (NEQ s77 1) (NEQ s139 1)) (OR (NEQ s90 1) (NEQ s128 1)) (OR (NEQ s54 1) (NEQ s103 1)) (OR (NEQ s49 1) (NEQ s108 1)) (OR (NEQ s97 1) (NEQ s153 1)) (OR (NEQ s57 1) (NEQ s115 1)) (OR (NEQ s69 1) (NEQ s118 1)) (OR (NEQ s73 1) (NEQ s122 1)) (OR (NEQ s61 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s131 1)) (OR (NEQ s68 1) (NEQ s111 1)) (OR (NEQ s74 1) (NEQ s121 1)) (OR (NEQ s99 1) (NEQ s151 1)) (OR (NEQ s80 1) (NEQ s126 1)) (OR (NEQ s71 1) (NEQ s134 1)) (OR (NEQ s83 1) (NEQ s137 1)) (OR (NEQ s63 1) (NEQ s124 1)) (OR (NEQ s78 1) (NEQ s140 1)) (OR (NEQ s55 1) (NEQ s106 1)) (OR (NEQ s72 1) (NEQ s133 1)) (OR (NEQ s98 1) (NEQ s154 1)) (OR (NEQ s60 1) (NEQ s101 1)) (OR (NEQ s91 1) (NEQ s129 1)) (OR (NEQ s86 1) (NEQ s132 1)) (OR (NEQ s50 1) (NEQ s107 1)) (OR (NEQ s70 1) (NEQ s117 1)) (OR (NEQ s87 1) (NEQ s150 1)) (OR (NEQ s81 1) (NEQ s135 1)) (OR (NEQ s65 1) (NEQ s114 1)) (OR (NEQ s53 1) (NEQ s104 1)) (OR (NEQ s96 1) (NEQ s156 1)) (OR (NEQ s93 1) (NEQ s141 1)) (OR (NEQ s100 1) (NEQ s152 1)) (OR (NEQ s89 1) (NEQ s127 1)) (OR (NEQ s58 1) (NEQ s116 1)) (OR (NEQ s64 1) (NEQ s123 1)) (OR (NEQ s95 1) (NEQ s155 1)) (OR (NEQ s84 1) (NEQ s138 1)) (OR (NEQ s62 1) (NEQ s109 1)) (OR (NEQ s51 1) (NEQ s94 1)) (OR (NEQ s75 1) (NEQ s120 1)) (OR (NEQ s67 1) (NEQ s112 1)) (OR (NEQ s59 1) (NEQ s102 1)) (OR (NEQ s92 1) (NEQ s130 1)) (OR (NEQ s79 1) (NEQ s125 1))), p0:(AND (OR (AND (EQ s68 1) (EQ s210 1)) (AND (EQ s59 1) (EQ s220 1)) (AND (EQ s73 1) (EQ s207 1)) (AND (EQ s69 1) (EQ s234 1)) (AND (EQ s85 1) (EQ s247 1)) (AND (EQ s80 1) (EQ s224 1)) (AND (EQ s51 1) (EQ s195 1)) (AND (EQ s78 1) (EQ s226 1)) (AND (EQ s56 1) (EQ s192 1)) (AND (EQ s63 1) (EQ s205 1)) (AND (EQ s83 1) (EQ s227 1)) (AND (EQ s54 1) (EQ s217 1)) (AND (EQ s99 1) (EQ s242 1)) (AND (EQ s66 1) (EQ s216 1)) (AND (EQ s61 1) (EQ s211 1)) (AND (EQ s82 1) (EQ s230 1)) (AND (EQ s50 1) (EQ s190 1)) (AND (EQ s55 1) (EQ s191 1)) (AND (EQ s71 1) (EQ s232 1)) (AND (EQ s76 1) (EQ s235 1)) (AND (EQ s74 1) (EQ s208 1)) (AND (EQ s60 1) (EQ s219 1)) (AND (EQ s57 1) (EQ s214 1)) (AND (EQ s90 1) (EQ s222 1)) (AND (EQ s77 1) (EQ s225 1)) (AND (EQ s88 1) (EQ s244 1)) (AND (EQ s93 1) (EQ s237 1)) (AND (EQ s97 1) (EQ s240 1)) (AND (EQ s84 1) (EQ s228 1)) (AND (EQ s58 1) (EQ s213 1)) (AND (EQ s89 1) (EQ s221 1)) (AND (EQ s53 1) (EQ s218 1)) (AND (EQ s100 1) (EQ s243 1)) (AND (EQ s75 1) (EQ s236 1)) (AND (EQ s91 1) (EQ s249 1)) (AND (EQ s62 1) (EQ s212 1)) (AND (EQ s64 1) (EQ s206 1)) (AND (EQ s86 1) (EQ s246 1)) (AND (EQ s70 1) (EQ s233 1)) (AND (EQ s67 1) (EQ s209 1)) (AND (EQ s95 1) (EQ s238 1)) (AND (EQ s79 1) (EQ s223 1)) (AND (EQ s72 1) (EQ s231 1)) (AND (EQ s49 1) (EQ s189 1)) (AND (EQ s96 1) (EQ s239 1)) (AND (EQ s87 1) (EQ s245 1)) (AND (EQ s98 1) (EQ s241 1)) (AND (EQ s65 1) (EQ s215 1)) (AND (EQ s81 1) (EQ s229 1)) (AND (EQ s92 1) (EQ s248 1))) (OR (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1) (EQ s29 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 754 reset in 923 ms.
Stack based approach found an accepted trace after 1543 steps with 14 reset with depth 82 and stack size 82 in 16 ms.
FORMULA Philosophers-PT-000050-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-04 finished in 1574 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0||X(!p1))))))], workingDir=/home/mcc/execution]
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:28] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:28] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:28] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:28] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:28] [INFO ] Computed 100 place invariants in 0 ms
[2021-06-06 14:35:28] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 164 ms :[p1, (AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0)), true]
Running random walk in product with property : Philosophers-PT-000050-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (OR (AND (EQ s68 1) (EQ s210 1)) (AND (EQ s59 1) (EQ s220 1)) (AND (EQ s73 1) (EQ s207 1)) (AND (EQ s69 1) (EQ s234 1)) (AND (EQ s85 1) (EQ s247 1)) (AND (EQ s80 1) (EQ s224 1)) (AND (EQ s51 1) (EQ s195 1)) (AND (EQ s78 1) (EQ s226 1)) (AND (EQ s56 1) (EQ s192 1)) (AND (EQ s63 1) (EQ s205 1)) (AND (EQ s83 1) (EQ s227 1)) (AND (EQ s54 1) (EQ s217 1)) (AND (EQ s99 1) (EQ s242 1)) (AND (EQ s66 1) (EQ s216 1)) (AND (EQ s61 1) (EQ s211 1)) (AND (EQ s82 1) (EQ s230 1)) (AND (EQ s50 1) (EQ s190 1)) (AND (EQ s55 1) (EQ s191 1)) (AND (EQ s71 1) (EQ s232 1)) (AND (EQ s76 1) (EQ s235 1)) (AND (EQ s74 1) (EQ s208 1)) (AND (EQ s60 1) (EQ s219 1)) (AND (EQ s57 1) (EQ s214 1)) (AND (EQ s90 1) (EQ s222 1)) (AND (EQ s77 1) (EQ s225 1)) (AND (EQ s88 1) (EQ s244 1)) (AND (EQ s93 1) (EQ s237 1)) (AND (EQ s97 1) (EQ s240 1)) (AND (EQ s84 1) (EQ s228 1)) (AND (EQ s58 1) (EQ s213 1)) (AND (EQ s89 1) (EQ s221 1)) (AND (EQ s53 1) (EQ s218 1)) (AND (EQ s100 1) (EQ s243 1)) (AND (EQ s75 1) (EQ s236 1)) (AND (EQ s91 1) (EQ s249 1)) (AND (EQ s62 1) (EQ s212 1)) (AND (EQ s64 1) (EQ s206 1)) (AND (EQ s86 1) (EQ s246 1)) (AND (EQ s70 1) (EQ s233 1)) (AND (EQ s67 1) (EQ s209 1)) (AND (EQ s95 1) (EQ s238 1)) (AND (EQ s79 1) (EQ s223 1)) (AND (EQ s72 1) (EQ s231 1)) (AND (EQ s49 1) (EQ s189 1)) (AND (EQ s96 1) (EQ s239 1)) (AND (EQ s87 1) (EQ s245 1)) (AND (EQ s98 1) (EQ s241 1)) (AND (EQ s65 1) (EQ s215 1)) (AND (EQ s81 1) (EQ s229 1)) (AND (EQ s92 1) (EQ s248 1))) (OR (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1) (EQ s29 1) (EQ s31 1) (EQ s33 1) (EQ s35 1) (EQ s37 1) (EQ s39 1) (EQ s41 1) (EQ s43 1) (EQ s45 1) (EQ s47 1) (EQ s0 1) (EQ s2 1) (EQ s4 1) (EQ s6 1) (EQ s8 1) (EQ s10 1) (EQ s12 1) (EQ s14 1) (EQ s16 1) (EQ s18 1) (EQ s20 1) (EQ s22 1) (EQ s24 1) (EQ s26 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s34 1) (EQ s36 1) (EQ s38 1) (EQ s40 1) (EQ s42 1) (EQ s44 1) (EQ s46 1) (EQ s48 1) (EQ s52 1))), p1:(AND (OR (NEQ s82 1) (NEQ s136 1)) (OR (NEQ s88 1) (NEQ s149 1)) (OR (NEQ s76 1) (NEQ s119 1)) (OR (NEQ s66 1) (NEQ s113 1)) (OR (NEQ s56 1) (NEQ s105 1)) (OR (NEQ s77 1) (NEQ s139 1)) (OR (NEQ s90 1) (NEQ s128 1)) (OR (NEQ s54 1) (NEQ s103 1)) (OR (NEQ s49 1) (NEQ s108 1)) (OR (NEQ s97 1) (NEQ s153 1)) (OR (NEQ s57 1) (NEQ s115 1)) (OR (NEQ s69 1) (NEQ s118 1)) (OR (NEQ s73 1) (NEQ s122 1)) (OR (NEQ s61 1) (NEQ s110 1)) (OR (NEQ s85 1) (NEQ s131 1)) (OR (NEQ s68 1) (NEQ s111 1)) (OR (NEQ s74 1) (NEQ s121 1)) (OR (NEQ s99 1) (NEQ s151 1)) (OR (NEQ s80 1) (NEQ s126 1)) (OR (NEQ s71 1) (NEQ s134 1)) (OR (NEQ s83 1) (NEQ s137 1)) (OR (NEQ s63 1) (NEQ s124 1)) (OR (NEQ s78 1) (NEQ s140 1)) (OR (NEQ s55 1) (NEQ s106 1)) (OR (NEQ s72 1) (NEQ s133 1)) (OR (NEQ s98 1) (NEQ s154 1)) (OR (NEQ s60 1) (NEQ s101 1)) (OR (NEQ s91 1) (NEQ s129 1)) (OR (NEQ s86 1) (NEQ s132 1)) (OR (NEQ s50 1) (NEQ s107 1)) (OR (NEQ s70 1) (NEQ s117 1)) (OR (NEQ s87 1) (NEQ s150 1)) (OR (NEQ s81 1) (NEQ s135 1)) (OR (NEQ s65 1) (NEQ s114 1)) (OR (NEQ s53 1) (NEQ s104 1)) (OR (NEQ s96 1) (NEQ s156 1)) (OR (NEQ s93 1) (NEQ s141 1)) (OR (NEQ s100 1) (NEQ s152 1)) (OR (NEQ s89 1) (NEQ s127 1)) (OR (NEQ s58 1) (NEQ s116 1)) (OR (NEQ s64 1) (NEQ s123 1)) (OR (NEQ s95 1) (NEQ s155 1)) (OR (NEQ s84 1) (NEQ s138 1)) (OR (NEQ s62 1) (NEQ s109 1)) (OR (NEQ s51 1) (NEQ s94 1)) (OR (NEQ s75 1) (NEQ s120 1)) (OR (NEQ s67 1) (NEQ s112 1)) (OR (NEQ s59 1) (NEQ s102 1)) (OR (NEQ s92 1) (NEQ s130 1)) (OR (NEQ s79 1) (NEQ s125 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 149 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000050-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-05 finished in 604 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((F(p2)||p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:29] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:29] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2021-06-06 14:35:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:29] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:29] [INFO ] Dead Transitions using invariants and state equation in 132 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Philosophers-PT-000050-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (NEQ s68 1) (NEQ s210 1)) (OR (NEQ s59 1) (NEQ s220 1)) (OR (NEQ s73 1) (NEQ s207 1)) (OR (NEQ s69 1) (NEQ s234 1)) (OR (NEQ s85 1) (NEQ s247 1)) (OR (NEQ s80 1) (NEQ s224 1)) (OR (NEQ s51 1) (NEQ s195 1)) (OR (NEQ s78 1) (NEQ s226 1)) (OR (NEQ s56 1) (NEQ s192 1)) (OR (NEQ s63 1) (NEQ s205 1)) (OR (NEQ s83 1) (NEQ s227 1)) (OR (NEQ s54 1) (NEQ s217 1)) (OR (NEQ s99 1) (NEQ s242 1)) (OR (NEQ s66 1) (NEQ s216 1)) (OR (NEQ s61 1) (NEQ s211 1)) (OR (NEQ s82 1) (NEQ s230 1)) (OR (NEQ s50 1) (NEQ s190 1)) (OR (NEQ s55 1) (NEQ s191 1)) (OR (NEQ s71 1) (NEQ s232 1)) (OR (NEQ s76 1) (NEQ s235 1)) (OR (NEQ s74 1) (NEQ s208 1)) (OR (NEQ s60 1) (NEQ s219 1)) (OR (NEQ s57 1) (NEQ s214 1)) (OR (NEQ s90 1) (NEQ s222 1)) (OR (NEQ s77 1) (NEQ s225 1)) (OR (NEQ s88 1) (NEQ s244 1)) (OR (NEQ s93 1) (NEQ s237 1)) (OR (NEQ s97 1) (NEQ s240 1)) (OR (NEQ s84 1) (NEQ s228 1)) (OR (NEQ s58 1) (NEQ s213 1)) (OR (NEQ s89 1) (NEQ s221 1)) (OR (NEQ s53 1) (NEQ s218 1)) (OR (NEQ s100 1) (NEQ s243 1)) (OR (NEQ s75 1) (NEQ s236 1)) (OR (NEQ s91 1) (NEQ s249 1)) (OR (NEQ s62 1) (NEQ s212 1)) (OR (NEQ s64 1) (NEQ s206 1)) (OR (NEQ s86 1) (NEQ s246 1)) (OR (NEQ s70 1) (NEQ s233 1)) (OR (NEQ s67 1) (NEQ s209 1)) (OR (NEQ s95 1) (NEQ s238 1)) (OR (NEQ s79 1) (NEQ s223 1)) (OR (NEQ s72 1) (NEQ s231 1)) (OR (NEQ s49 1) (NEQ s189 1)) (OR (NEQ s96 1) (NEQ s239 1)) (OR (NEQ s87 1) (NEQ s245 1)) (OR (NEQ s98 1) (NEQ s241 1)) (OR (NEQ s65 1) (NEQ s215 1)) (OR (NEQ s81 1) (NEQ s229 1)) (OR (NEQ s92 1) (NEQ s248 1))), p1:(OR (AND (NEQ s96 0) (NEQ s196 0)) (AND (NEQ s60 0) (NEQ s167 0)) (AND (NEQ s74 0) (NEQ s162 0)) (AND (NEQ s81 0) (NEQ s185 0)) (AND (NEQ s70 0) (NEQ s181 0)) (AND (NEQ s49 0) (NEQ s145 0)) (AND (NEQ s72 0) (NEQ s187 0)) (AND (NEQ s66 0) (NEQ s170 0)) (AND (NEQ s58 0) (NEQ s165 0)) (AND (NEQ s98 0) (NEQ s194 0)) (AND (NEQ s54 0) (NEQ s148 0)) (AND (NEQ s62 0) (NEQ s158 0)) (AND (NEQ s57 0) (NEQ s172 0)) (AND (NEQ s93 0) (NEQ s142 0)) (AND (NEQ s53 0) (NEQ s168 0)) (AND (NEQ s92 0) (NEQ s178 0)) (AND (NEQ s73 0) (NEQ s163 0)) (AND (NEQ s68 0) (NEQ s160 0)) (AND (NEQ s95 0) (NEQ s193 0)) (AND (NEQ s79 0) (NEQ s179 0)) (AND (NEQ s89 0) (NEQ s177 0)) (AND (NEQ s100 0) (NEQ s200 0)) (AND (NEQ s59 0) (NEQ s166 0)) (AND (NEQ s84 0) (NEQ s186 0)) (AND (NEQ s91 0) (NEQ s202 0)) (AND (NEQ s80 0) (NEQ s174 0)) (AND (NEQ s90 0) (NEQ s180 0)) (AND (NEQ s76 0) (NEQ s183 0)) (AND (NEQ s65 0) (NEQ s171 0)) (AND (NEQ s97 0) (NEQ s199 0)) (AND (NEQ s86 0) (NEQ s201 0)) (AND (NEQ s88 0) (NEQ s203 0)) (AND (NEQ s63 0) (NEQ s157 0)) (AND (NEQ s55 0) (NEQ s147 0)) (AND (NEQ s75 0) (NEQ s161 0)) (AND (NEQ s82 0) (NEQ s188 0)) (AND (NEQ s69 0) (NEQ s184 0)) (AND (NEQ s50 0) (NEQ s144 0)) (AND (NEQ s78 0) (NEQ s176 0)) (AND (NEQ s99 0) (NEQ s197 0)) (AND (NEQ s51 0) (NEQ s143 0)) (AND (NEQ s56 0) (NEQ s146 0)) (AND (NEQ s85 0) (NEQ s204 0)) (AND (NEQ s67 0) (NEQ s169 0)) (AND (NEQ s83 0) (NEQ s175 0)) (AND (NEQ s77 0) (NEQ s173 0)) (AND (NEQ s61 0) (NEQ s159 0)) (AND (NEQ s64 0) (NEQ s164 0)) (AND (NEQ s71 0) (NEQ s182 0)) (AND (NEQ s87 0) (NEQ s198 0))), p2:(OR (AND (EQ s96 1) (EQ s196 1)) (AND (EQ s60 1) (EQ s167 1)) (AND (EQ s74 1) (EQ s162 1)) (AND (EQ s81 1) (EQ s185 1)) (AND (EQ s70 1) (EQ s181 1)) (AND (EQ s49 1) (EQ s145 1)) (AND (EQ s72 1) (EQ s187 1)) (AND (EQ s66 1) (EQ s170 1)) (AND (EQ s58 1) (EQ s165 1)) (AND (EQ s98 1) (EQ s194 1)) (AND (EQ s54 1) (EQ s148 1)) (AND (EQ s62 1) (EQ s158 1)) (AND (EQ s57 1) (EQ s172 1)) (AND (EQ s93 1) (EQ s142 1)) (AND (EQ s53 1) (EQ s168 1)) (AND (EQ s92 1) (EQ s178 1)) (AND (EQ s73 1) (EQ s163 1)) (AND (EQ s68 1) (EQ s160 1)) (AND (EQ s95 1) (EQ s193 1)) (AND (EQ s79 1) (EQ s179 1)) (AND (EQ s89 1) (EQ s177 1)) (AND (EQ s100 1) (EQ s200 1)) (AND (EQ s59 1) (EQ s166 1)) (AND (EQ s84 1) (EQ s186 1)) (AND (EQ s91 1) (EQ s202 1)) (AND (EQ s80 1) (EQ s174 1)) (AND (EQ s90 1) (EQ s180 1)) (AND (EQ s76 1) (EQ s183 1)) (AND (EQ s65 1) (EQ s171 1)) (AND (EQ s97 1) (EQ s199 1)) (AND (EQ s86 1) (EQ s201 1)) (AND (EQ s88 1) (EQ s203 1)) (AND (EQ s63 1) (EQ s157 1)) (AND (EQ s55 1) (EQ s147 1)) (AND (EQ s75 1) (EQ s161 1)) (AND (EQ s82 1) (EQ s188 1)) (AND (EQ s69 1) (EQ s184 1)) (AND (EQ s50 1) (EQ s144 1)) (AND (EQ s78 1) (EQ s176 1)) (AND (EQ s99 1) (EQ s197 1)) (AND (EQ s51 1) (EQ s143 1)) (AND (EQ s56 1) (EQ s146 1)) (AND (EQ s85 1) (EQ s204 1)) (AND (EQ s67 1) (EQ s169 1)) (AND (EQ s83 1) (EQ s175 1)) (AND (EQ s77 1) (EQ s173 1)) (AND (EQ s61 1) (EQ s159 1)) (AND (EQ s64 1) (EQ s164 1)) (AND (EQ s71 1) (EQ s182 1)) (AND (EQ s87 1) (EQ s198 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 865 reset in 798 ms.
Stack based approach found an accepted trace after 69 steps with 1 reset with depth 66 and stack size 66 in 1 ms.
FORMULA Philosophers-PT-000050-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-07 finished in 1293 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&X(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:30] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:30] [INFO ] Implicit Places using invariants in 127 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:30] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:30] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:30] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:30] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-000050-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s79 1) (NEQ s128 1) (NEQ s71 1) (NEQ s133 1)), p1:(OR (NEQ s79 1) (NEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 1 reset in 0 ms.
FORMULA Philosophers-PT-000050-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-09 finished in 639 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:31] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:31] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:31] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:31] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:31] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:31] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 23597 steps with 2978 reset in 134 ms.
FORMULA Philosophers-PT-000050-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-12 finished in 720 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:31] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:31] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:31] [INFO ] Computed 100 place invariants in 8 ms
[2021-06-06 14:35:32] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:32] [INFO ] Computed 100 place invariants in 5 ms
[2021-06-06 14:35:32] [INFO ] Dead Transitions using invariants and state equation in 159 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s58 1) (EQ s116 1) (EQ s74 1) (EQ s120 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 4361 steps with 51 reset in 14 ms.
FORMULA Philosophers-PT-000050-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-13 finished in 642 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U (X(p2)&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:32] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:32] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:32] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:32] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:32] [INFO ] Computed 100 place invariants in 1 ms
[2021-06-06 14:35:32] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Philosophers-PT-000050-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(AND (EQ s53 1) (EQ s218 1)), p0:(OR (EQ s74 0) (EQ s162 0)), p2:(AND (EQ s53 1) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 258 ms.
Stack based approach found an accepted trace after 3237 steps with 0 reset with depth 3238 and stack size 3153 in 12 ms.
FORMULA Philosophers-PT-000050-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-14 finished in 957 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:33] [INFO ] Computed 100 place invariants in 0 ms
[2021-06-06 14:35:33] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:33] [INFO ] Computed 100 place invariants in 3 ms
[2021-06-06 14:35:33] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2021-06-06 14:35:33] [INFO ] Computed 100 place invariants in 2 ms
[2021-06-06 14:35:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Philosophers-PT-000050-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s195 1)), p1:(AND (EQ s73 1) (EQ s122 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 267 steps with 1 reset in 3 ms.
FORMULA Philosophers-PT-000050-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-15 finished in 683 ms.
All properties solved without resorting to model-checking.

BK_STOP 1622990135295

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="Philosophers-PT-000050"
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 Philosophers-PT-000050, 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 r140-tall-162298996000125"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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