Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 66K May 10 09:33 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 DES-PT-00b-LTLFireability-00
FORMULA_NAME DES-PT-00b-LTLFireability-01
FORMULA_NAME DES-PT-00b-LTLFireability-02
FORMULA_NAME DES-PT-00b-LTLFireability-03
FORMULA_NAME DES-PT-00b-LTLFireability-04
FORMULA_NAME DES-PT-00b-LTLFireability-05
FORMULA_NAME DES-PT-00b-LTLFireability-06
FORMULA_NAME DES-PT-00b-LTLFireability-07
FORMULA_NAME DES-PT-00b-LTLFireability-08
FORMULA_NAME DES-PT-00b-LTLFireability-09
FORMULA_NAME DES-PT-00b-LTLFireability-10
FORMULA_NAME DES-PT-00b-LTLFireability-11
FORMULA_NAME DES-PT-00b-LTLFireability-12
FORMULA_NAME DES-PT-00b-LTLFireability-13
FORMULA_NAME DES-PT-00b-LTLFireability-14
FORMULA_NAME DES-PT-00b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652708383641

Running Version 202205111006
[2022-05-16 13:39:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 13:39:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:39:46] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2022-05-16 13:39:46] [INFO ] Transformed 271 places.
[2022-05-16 13:39:46] [INFO ] Transformed 230 transitions.
[2022-05-16 13:39:46] [INFO ] Found NUPN structural information;
[2022-05-16 13:39:46] [INFO ] Parsed PT model containing 271 places and 230 transitions in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DES-PT-00b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 250 transition count 211
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 250 transition count 211
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 238 transition count 199
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 238 transition count 199
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 238 transition count 190
Applied a total of 73 rules in 134 ms. Remains 238 /271 variables (removed 33) and now considering 190/230 (removed 40) transitions.
// Phase 1: matrix 190 rows 238 cols
[2022-05-16 13:39:47] [INFO ] Computed 57 place invariants in 34 ms
[2022-05-16 13:39:47] [INFO ] Implicit Places using invariants in 579 ms returned []
// Phase 1: matrix 190 rows 238 cols
[2022-05-16 13:39:47] [INFO ] Computed 57 place invariants in 10 ms
[2022-05-16 13:39:48] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
// Phase 1: matrix 190 rows 238 cols
[2022-05-16 13:39:48] [INFO ] Computed 57 place invariants in 13 ms
[2022-05-16 13:39:48] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/271 places, 190/230 transitions.
Finished structural reductions, in 1 iterations. Remains : 238/271 places, 190/230 transitions.
Support contains 35 out of 238 places after structural reductions.
[2022-05-16 13:39:49] [INFO ] Flatten gal took : 97 ms
[2022-05-16 13:39:49] [INFO ] Flatten gal took : 43 ms
[2022-05-16 13:39:49] [INFO ] Input system was already deterministic with 190 transitions.
Finished random walk after 6540 steps, including 58 resets, run visited all 24 properties in 680 ms. (steps per millisecond=9 )
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 424 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 232 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 232 transition count 184
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 228 transition count 180
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 228 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 228 transition count 177
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 227 transition count 176
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 227 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 227 transition count 175
Applied a total of 26 rules in 57 ms. Remains 227 /238 variables (removed 11) and now considering 175/190 (removed 15) transitions.
// Phase 1: matrix 175 rows 227 cols
[2022-05-16 13:39:50] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:39:50] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 175 rows 227 cols
[2022-05-16 13:39:50] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-16 13:39:50] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
// Phase 1: matrix 175 rows 227 cols
[2022-05-16 13:39:50] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:39:51] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 227/238 places, 175/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 227/238 places, 175/190 transitions.
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s13 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DES-PT-00b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-03 finished in 1131 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((G((p0 U X(p0))) U p1)&&X(p2)))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 231 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 231 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 231 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 228 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 228 transition count 179
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 228 transition count 177
Applied a total of 23 rules in 45 ms. Remains 228 /238 variables (removed 10) and now considering 177/190 (removed 13) transitions.
// Phase 1: matrix 177 rows 228 cols
[2022-05-16 13:39:51] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:39:51] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 177 rows 228 cols
[2022-05-16 13:39:51] [INFO ] Computed 57 place invariants in 18 ms
[2022-05-16 13:39:52] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
// Phase 1: matrix 177 rows 228 cols
[2022-05-16 13:39:52] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-16 13:39:52] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/238 places, 177/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/238 places, 177/190 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : DES-PT-00b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s18 1), p0:(AND (EQ s62 1) (EQ s68 1)), p2:(OR (EQ s62 0) (EQ s68 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-05 finished in 1288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(X(p0)))||F(p1)))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 231 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 231 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 231 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 227 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 227 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 226 transition count 173
Applied a total of 29 rules in 34 ms. Remains 226 /238 variables (removed 12) and now considering 173/190 (removed 17) transitions.
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:39:52] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 13:39:53] [INFO ] Implicit Places using invariants in 182 ms returned []
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:39:53] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-16 13:39:53] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:39:53] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:39:53] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/238 places, 173/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 226/238 places, 173/190 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-00b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}]], initial=2, aps=[p1:(EQ s65 0), p0:(AND (OR (EQ s121 0) (EQ s152 0)) (EQ s216 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 644 ms.
Product exploration explored 100000 steps with 33333 reset in 352 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 2 factoid took 52 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-00b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00b-LTLFireability-06 finished in 2297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X((X(p0)&&p1)))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 231 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 231 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 231 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 227 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 227 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 226 transition count 173
Applied a total of 29 rules in 21 ms. Remains 226 /238 variables (removed 12) and now considering 173/190 (removed 17) transitions.
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:39:55] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 13:39:55] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:39:55] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 13:39:55] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:39:55] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:39:55] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/238 places, 173/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 226/238 places, 173/190 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-00b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(EQ s103 1), p0:(OR (EQ s7 0) (EQ s11 0) (EQ s21 0) (EQ s22 0) (EQ s26 0) (EQ s32 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 164 steps with 2 reset in 3 ms.
FORMULA DES-PT-00b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-08 finished in 741 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(((!p1 U (p2||G(!p1))) U ((p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Graph (complete) has 424 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 233 transition count 167
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 215 transition count 167
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 215 transition count 156
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 204 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 201 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 201 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 201 transition count 152
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 199 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 199 transition count 150
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 199 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 72 place count 199 transition count 147
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 198 transition count 147
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 222 place count 124 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 223 place count 124 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 227 place count 122 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 120 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 231 place count 118 transition count 75
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 6 with 2 rules applied. Total rules applied 233 place count 117 transition count 74
Applied a total of 233 rules in 82 ms. Remains 117 /238 variables (removed 121) and now considering 74/190 (removed 116) transitions.
// Phase 1: matrix 74 rows 117 cols
[2022-05-16 13:39:55] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-16 13:39:56] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 74 rows 117 cols
[2022-05-16 13:39:56] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:39:56] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2022-05-16 13:39:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 74 rows 117 cols
[2022-05-16 13:39:56] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:39:56] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/238 places, 74/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/238 places, 74/190 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-00b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s97 1), p1:(AND (EQ s31 1) (EQ s94 1)), p2:(AND (NEQ s97 1) (NOT (AND (EQ s31 1) (EQ s94 1)))), p3:(NEQ s5 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 6376 reset in 658 ms.
Product exploration explored 100000 steps with 6394 reset in 332 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))))]
Knowledge based reduction with 9 factoid took 435 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 312 steps, including 18 resets, run visited all 5 properties in 5 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT p0)), (F (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 767 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 117 cols
[2022-05-16 13:39:59] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:39:59] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 74 rows 117 cols
[2022-05-16 13:39:59] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-16 13:39:59] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2022-05-16 13:39:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 74 rows 117 cols
[2022-05-16 13:39:59] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:00] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 74/74 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))))]
Knowledge based reduction with 9 factoid took 535 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Finished random walk after 1620 steps, including 104 resets, run visited all 5 properties in 17 ms. (steps per millisecond=95 )
Knowledge obtained : [(AND p0 (NOT p1) p2 p3), (X (NOT (AND (NOT p1) (NOT p2) p3))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p2) p3)), (F (NOT p0)), (F (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 768 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 6401 reset in 403 ms.
Product exploration explored 100000 steps with 6435 reset in 436 ms.
Built C files in :
/tmp/ltsmin12374775563282017339
[2022-05-16 13:40:03] [INFO ] Computing symmetric may disable matrix : 74 transitions.
[2022-05-16 13:40:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:03] [INFO ] Computing symmetric may enable matrix : 74 transitions.
[2022-05-16 13:40:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:03] [INFO ] Computing Do-Not-Accords matrix : 74 transitions.
[2022-05-16 13:40:03] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:03] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12374775563282017339
Running compilation step : cd /tmp/ltsmin12374775563282017339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 653 ms.
Running link step : cd /tmp/ltsmin12374775563282017339;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin12374775563282017339;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2283301459839475222.hoa' '--buchi-type=spotba'
LTSmin run took 891 ms.
FORMULA DES-PT-00b-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-00b-LTLFireability-09 finished in 9010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Graph (complete) has 424 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 233 transition count 167
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 215 transition count 167
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 215 transition count 155
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 61 place count 203 transition count 155
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 199 transition count 151
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 199 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 199 transition count 150
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 196 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 196 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 80 place count 196 transition count 143
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 82 place count 195 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 82 place count 195 transition count 141
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 84 place count 194 transition count 141
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 230 place count 121 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 119 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 117 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 115 transition count 68
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 6 with 2 rules applied. Total rules applied 240 place count 114 transition count 67
Applied a total of 240 rules in 78 ms. Remains 114 /238 variables (removed 124) and now considering 67/190 (removed 123) transitions.
// Phase 1: matrix 67 rows 114 cols
[2022-05-16 13:40:04] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:05] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 67 rows 114 cols
[2022-05-16 13:40:05] [INFO ] Computed 55 place invariants in 4 ms
[2022-05-16 13:40:05] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2022-05-16 13:40:05] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 67 rows 114 cols
[2022-05-16 13:40:05] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:05] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/238 places, 67/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/238 places, 67/190 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s15 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 9 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-10 finished in 769 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(p1)&&F(!p2))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 232 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 232 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 232 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 229 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 229 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 229 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 228 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 228 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 228 transition count 176
Applied a total of 24 rules in 47 ms. Remains 228 /238 variables (removed 10) and now considering 176/190 (removed 14) transitions.
// Phase 1: matrix 176 rows 228 cols
[2022-05-16 13:40:05] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 13:40:05] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 176 rows 228 cols
[2022-05-16 13:40:05] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:40:06] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 228 cols
[2022-05-16 13:40:06] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:40:06] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/238 places, 176/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/238 places, 176/190 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) p2), (NOT p1), p2, (NOT p1), true, (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s106 1), p2:(AND (EQ s42 1) (EQ s57 1)), p1:(NEQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 334 ms.
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 406 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 12 factoid took 453 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-00b-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00b-LTLFireability-11 finished in 2429 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U X(p1))))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 231 transition count 183
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 231 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 231 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 227 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 227 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 226 transition count 173
Applied a total of 29 rules in 24 ms. Remains 226 /238 variables (removed 12) and now considering 173/190 (removed 17) transitions.
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:40:08] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:40:08] [INFO ] Implicit Places using invariants in 239 ms returned []
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:40:08] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:40:08] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
// Phase 1: matrix 173 rows 226 cols
[2022-05-16 13:40:08] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:40:09] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 226/238 places, 173/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 226/238 places, 173/190 transitions.
Stuttering acceptance computed with spot in 110 ms :[p1, p1, p1, true]
Running random walk in product with property : DES-PT-00b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s80 1), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Graph (complete) has 401 edges and 226 vertex of which 224 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 26 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-00b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-00b-LTLFireability-12 finished in 1579 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(X(F(X(p0)))))&&p1)))'
Support contains 3 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 232 transition count 184
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 232 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 232 transition count 183
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 229 transition count 180
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 229 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 229 transition count 178
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 228 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 228 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 228 transition count 176
Applied a total of 24 rules in 25 ms. Remains 228 /238 variables (removed 10) and now considering 176/190 (removed 14) transitions.
// Phase 1: matrix 176 rows 228 cols
[2022-05-16 13:40:09] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:40:09] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 176 rows 228 cols
[2022-05-16 13:40:09] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:40:10] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 228 cols
[2022-05-16 13:40:10] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:40:10] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/238 places, 176/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 228/238 places, 176/190 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DES-PT-00b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s134 1) (EQ s168 1)), p1:(EQ s10 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 1 ms.
FORMULA DES-PT-00b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-13 finished in 1271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F((p1 U (p2||G(p1)))))))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Graph (complete) has 424 edges and 238 vertex of which 236 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 235 transition count 169
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 217 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 216 transition count 168
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 39 place count 216 transition count 156
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 63 place count 204 transition count 156
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 200 transition count 152
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 200 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 200 transition count 151
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 75 place count 197 transition count 148
Iterating global reduction 4 with 3 rules applied. Total rules applied 78 place count 197 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 82 place count 197 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 84 place count 196 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 84 place count 196 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 86 place count 195 transition count 142
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 6 with 144 rules applied. Total rules applied 230 place count 123 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 234 place count 121 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 120 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 237 place count 118 transition count 71
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 7 with 2 rules applied. Total rules applied 239 place count 117 transition count 70
Applied a total of 239 rules in 66 ms. Remains 117 /238 variables (removed 121) and now considering 70/190 (removed 120) transitions.
// Phase 1: matrix 70 rows 117 cols
[2022-05-16 13:40:10] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:11] [INFO ] Implicit Places using invariants in 193 ms returned []
// Phase 1: matrix 70 rows 117 cols
[2022-05-16 13:40:11] [INFO ] Computed 55 place invariants in 5 ms
[2022-05-16 13:40:11] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2022-05-16 13:40:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 70 rows 117 cols
[2022-05-16 13:40:11] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:11] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/238 places, 70/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/238 places, 70/190 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-00b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s31 1), p2:(AND (NOT (AND (EQ s33 1) (EQ s35 1))) (NEQ s15 1)), p1:(NEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6633 reset in 397 ms.
Product exploration explored 100000 steps with 6635 reset in 323 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 392 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/117 stabilizing places and 2/70 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 601 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 165 steps, including 5 resets, run visited all 2 properties in 4 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 612 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 117 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 70/70 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 70/70 (removed 0) transitions.
// Phase 1: matrix 70 rows 117 cols
[2022-05-16 13:40:14] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:14] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 70 rows 117 cols
[2022-05-16 13:40:14] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-16 13:40:14] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2022-05-16 13:40:14] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 70 rows 117 cols
[2022-05-16 13:40:14] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 70/70 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 392 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 261 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 1741 steps, including 109 resets, run visited all 2 properties in 14 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 305 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6591 reset in 368 ms.
Product exploration explored 100000 steps with 6528 reset in 417 ms.
Built C files in :
/tmp/ltsmin13398076587213860813
[2022-05-16 13:40:16] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2022-05-16 13:40:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:16] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2022-05-16 13:40:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:16] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2022-05-16 13:40:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:16] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13398076587213860813
Running compilation step : cd /tmp/ltsmin13398076587213860813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 418 ms.
Running link step : cd /tmp/ltsmin13398076587213860813;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin13398076587213860813;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16913096919288063003.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 70/70 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 115 transition count 68
Applied a total of 1 rules in 6 ms. Remains 115 /117 variables (removed 2) and now considering 68/70 (removed 2) transitions.
// Phase 1: matrix 68 rows 115 cols
[2022-05-16 13:40:31] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:32] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 68 rows 115 cols
[2022-05-16 13:40:32] [INFO ] Computed 55 place invariants in 0 ms
[2022-05-16 13:40:32] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2022-05-16 13:40:32] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 68 rows 115 cols
[2022-05-16 13:40:32] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:40:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 68/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 115/117 places, 68/70 transitions.
Built C files in :
/tmp/ltsmin9684286517837196828
[2022-05-16 13:40:32] [INFO ] Computing symmetric may disable matrix : 68 transitions.
[2022-05-16 13:40:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:32] [INFO ] Computing symmetric may enable matrix : 68 transitions.
[2022-05-16 13:40:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:32] [INFO ] Computing Do-Not-Accords matrix : 68 transitions.
[2022-05-16 13:40:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 13:40:32] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9684286517837196828
Running compilation step : cd /tmp/ltsmin9684286517837196828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin9684286517837196828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9684286517837196828;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16950178300198224294.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 13:40:47] [INFO ] Flatten gal took : 12 ms
[2022-05-16 13:40:47] [INFO ] Flatten gal took : 10 ms
[2022-05-16 13:40:47] [INFO ] Time to serialize gal into /tmp/LTL10343876269910931837.gal : 4 ms
[2022-05-16 13:40:47] [INFO ] Time to serialize properties into /tmp/LTL16240690474754740826.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10343876269910931837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16240690474754740826.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1034387...268
Read 1 LTL properties
Checking formula 0 : !(((G("(p119==1)"))||(G(F(("(p70!=1)")U(("((!((p124==1)&&(p126==1)))&&(p70!=1))")||(G("(p70!=1)"))))))))
Formula 0 simplified : !(G"(p119==1)" | GF("(p70!=1)" U ("((!((p124==1)&&(p126==1)))&&(p70!=1))" | G"(p70!=1)")))
Detected timeout of ITS tools.
[2022-05-16 13:41:02] [INFO ] Flatten gal took : 10 ms
[2022-05-16 13:41:02] [INFO ] Applying decomposition
[2022-05-16 13:41:02] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18361145178289377315.txt' '-o' '/tmp/graph18361145178289377315.bin' '-w' '/tmp/graph18361145178289377315.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18361145178289377315.bin' '-l' '-1' '-v' '-w' '/tmp/graph18361145178289377315.weights' '-q' '0' '-e' '0.001'
[2022-05-16 13:41:02] [INFO ] Decomposing Gal with order
[2022-05-16 13:41:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 13:41:02] [INFO ] Removed a total of 49 redundant transitions.
[2022-05-16 13:41:02] [INFO ] Flatten gal took : 63 ms
[2022-05-16 13:41:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 10 ms.
[2022-05-16 13:41:02] [INFO ] Time to serialize gal into /tmp/LTL17990584689415245897.gal : 5 ms
[2022-05-16 13:41:02] [INFO ] Time to serialize properties into /tmp/LTL17354026564515855896.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17990584689415245897.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17354026564515855896.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1799058...247
Read 1 LTL properties
Checking formula 0 : !(((G("(i14.u11.p119==1)"))||(G(F(("(i2.u7.p70!=1)")U(("((!((i4.i0.u12.p124==1)&&(i4.i0.u13.p126==1)))&&(i2.u7.p70!=1))")||(G("(i2.u7....171
Formula 0 simplified : !(G"(i14.u11.p119==1)" | GF("(i2.u7.p70!=1)" U ("((!((i4.i0.u12.p124==1)&&(i4.i0.u13.p126==1)))&&(i2.u7.p70!=1))" | G"(i2.u7.p70!=1)...159
Reverse transition relation is NOT exact ! Due to transitions t9_t29, t16_t74_t17_t24_t34_t72_t35_t37_t48_t64_t65_t66_t67_t68_t69_t70_t49_t51_t53_t55_t57_t...467
Computing Next relation with stutter on 82586 deadlock states
16 unique states visited
0 strongly connected components in search stack
21 transitions explored
11 items max in DFS search stack
616 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,6.18838,212940,1,0,562679,1040,1416,400653,305,5200,687859
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-00b-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-00b-LTLFireability-14 finished in 59407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 190/190 transitions.
Graph (complete) has 424 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 233 transition count 166
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 214 transition count 166
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 39 place count 214 transition count 154
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 63 place count 202 transition count 154
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 198 transition count 150
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 198 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 198 transition count 149
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 75 place count 195 transition count 146
Iterating global reduction 3 with 3 rules applied. Total rules applied 78 place count 195 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 82 place count 195 transition count 142
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 84 place count 194 transition count 141
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 84 place count 194 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 86 place count 193 transition count 140
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 5 with 144 rules applied. Total rules applied 230 place count 121 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 119 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 117 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 238 place count 115 transition count 68
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 6 with 2 rules applied. Total rules applied 240 place count 114 transition count 67
Applied a total of 240 rules in 32 ms. Remains 114 /238 variables (removed 124) and now considering 67/190 (removed 123) transitions.
// Phase 1: matrix 67 rows 114 cols
[2022-05-16 13:41:10] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:41:10] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 67 rows 114 cols
[2022-05-16 13:41:10] [INFO ] Computed 55 place invariants in 2 ms
[2022-05-16 13:41:10] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2022-05-16 13:41:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 67 rows 114 cols
[2022-05-16 13:41:10] [INFO ] Computed 55 place invariants in 1 ms
[2022-05-16 13:41:10] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/238 places, 67/190 transitions.
Finished structural reductions, in 1 iterations. Remains : 114/238 places, 67/190 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-00b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s32 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 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-00b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-00b-LTLFireability-15 finished in 748 ms.
All properties solved by simple procedures.
Total runtime 84898 ms.

BK_STOP 1652708471207

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-00b"
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 DES-PT-00b, 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 r042-smll-165252095700396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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