Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r037-tajo-167813690400460.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is BusinessProcesses-PT-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690400460
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 59K Mar 5 18:22 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 BusinessProcesses-PT-02-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678359912246

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 11:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 11:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 11:05:14] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-09 11:05:14] [INFO ] Transformed 262 places.
[2023-03-09 11:05:14] [INFO ] Transformed 219 transitions.
[2023-03-09 11:05:14] [INFO ] Found NUPN structural information;
[2023-03-09 11:05:14] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 245 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 245/245 places, 204/204 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 239 transition count 204
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 29 place count 216 transition count 181
Iterating global reduction 1 with 23 rules applied. Total rules applied 52 place count 216 transition count 181
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 206 transition count 171
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 206 transition count 171
Applied a total of 72 rules in 42 ms. Remains 206 /245 variables (removed 39) and now considering 171/204 (removed 33) transitions.
// Phase 1: matrix 171 rows 206 cols
[2023-03-09 11:05:14] [INFO ] Computed 37 place invariants in 15 ms
[2023-03-09 11:05:14] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-09 11:05:14] [INFO ] Invariant cache hit.
[2023-03-09 11:05:14] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-09 11:05:14] [INFO ] Invariant cache hit.
[2023-03-09 11:05:14] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/245 places, 171/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 206/245 places, 171/204 transitions.
Support contains 40 out of 206 places after structural reductions.
[2023-03-09 11:05:14] [INFO ] Flatten gal took : 39 ms
[2023-03-09 11:05:14] [INFO ] Flatten gal took : 13 ms
[2023-03-09 11:05:14] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 39 out of 206 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 27) seen :16
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 11:05:15] [INFO ] Invariant cache hit.
[2023-03-09 11:05:16] [INFO ] [Real]Absence check using 28 positive place invariants in 4 ms returned sat
[2023-03-09 11:05:16] [INFO ] [Real]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-09 11:05:16] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-09 11:05:16] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2023-03-09 11:05:16] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-09 11:05:16] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-09 11:05:16] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
[2023-03-09 11:05:16] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-09 11:05:16] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-09 11:05:16] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
[2023-03-09 11:05:16] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2023-03-09 11:05:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 395 ms
[2023-03-09 11:05:16] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-09 11:05:16] [INFO ] After 723ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 10 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (complete) has 401 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 203 transition count 141
Reduce places removed 26 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 177 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 175 transition count 139
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 58 place count 175 transition count 100
Deduced a syphon composed of 39 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 142 place count 130 transition count 100
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 150 place count 122 transition count 92
Iterating global reduction 3 with 8 rules applied. Total rules applied 158 place count 122 transition count 92
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 254 place count 73 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 73 transition count 44
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 257 place count 73 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 258 place count 72 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 71 transition count 43
Applied a total of 259 rules in 53 ms. Remains 71 /206 variables (removed 135) and now considering 43/171 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 71/206 places, 43/171 transitions.
Finished random walk after 2722 steps, including 299 resets, run visited all 7 properties in 64 ms. (steps per millisecond=42 )
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 198 stabilizing places and 161 stable transitions
Graph (complete) has 401 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 105 edges and 206 vertex of which 7 / 206 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 394 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 196 transition count 130
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 166 transition count 130
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 62 place count 166 transition count 92
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 146 place count 120 transition count 92
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 156 place count 110 transition count 82
Iterating global reduction 2 with 10 rules applied. Total rules applied 166 place count 110 transition count 82
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 258 place count 63 transition count 37
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 2 with 2 rules applied. Total rules applied 260 place count 62 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 261 place count 61 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 262 place count 60 transition count 35
Applied a total of 262 rules in 28 ms. Remains 60 /206 variables (removed 146) and now considering 35/171 (removed 136) transitions.
// Phase 1: matrix 35 rows 60 cols
[2023-03-09 11:05:17] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-09 11:05:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 11:05:17] [INFO ] Invariant cache hit.
[2023-03-09 11:05:17] [INFO ] Implicit Places using invariants and state equation in 56 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 16, 18, 20, 22, 23, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42]
Discarding 25 places :
Implicit Place search using SMT with State Equation took 98 ms to find 25 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/206 places, 35/171 transitions.
Graph (complete) has 67 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 33 transition count 28
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 27 transition count 28
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 22 place count 22 transition count 24
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 2 with 2 rules applied. Total rules applied 24 place count 21 transition count 23
Applied a total of 24 rules in 3 ms. Remains 21 /35 variables (removed 14) and now considering 23/35 (removed 12) transitions.
// Phase 1: matrix 23 rows 21 cols
[2023-03-09 11:05:17] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-09 11:05:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 11:05:17] [INFO ] Invariant cache hit.
[2023-03-09 11:05:17] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/206 places, 23/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 21/206 places, 23/171 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s18 1) (EQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-00 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 194 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 194 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 188 transition count 153
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 188 transition count 153
Applied a total of 36 rules in 7 ms. Remains 188 /206 variables (removed 18) and now considering 153/171 (removed 18) transitions.
// Phase 1: matrix 153 rows 188 cols
[2023-03-09 11:05:17] [INFO ] Computed 37 place invariants in 6 ms
[2023-03-09 11:05:17] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-09 11:05:17] [INFO ] Invariant cache hit.
[2023-03-09 11:05:18] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-09 11:05:18] [INFO ] Invariant cache hit.
[2023-03-09 11:05:18] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 188/206 places, 153/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 188/206 places, 153/171 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-01 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 s52 1) (EQ s151 1) (EQ s171 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 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-01 finished in 440 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(p1&&F(p2))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 102 edges and 206 vertex of which 4 / 206 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 398 edges and 203 vertex of which 200 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 199 transition count 134
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 169 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 168 transition count 133
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 64 place count 168 transition count 96
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 146 place count 123 transition count 96
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 155 place count 114 transition count 87
Iterating global reduction 3 with 9 rules applied. Total rules applied 164 place count 114 transition count 87
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 260 place count 65 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 262 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 263 place count 63 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 264 place count 62 transition count 38
Applied a total of 264 rules in 40 ms. Remains 62 /206 variables (removed 144) and now considering 38/171 (removed 133) transitions.
// Phase 1: matrix 38 rows 62 cols
[2023-03-09 11:05:18] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-09 11:05:18] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 11:05:18] [INFO ] Invariant cache hit.
[2023-03-09 11:05:18] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 38, 40, 42]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 149 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/206 places, 38/171 transitions.
Graph (complete) has 74 edges and 38 vertex of which 36 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 36 transition count 32
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 31 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 29 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 29 transition count 30
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 23 place count 25 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 25 transition count 25
Applied a total of 24 rules in 5 ms. Remains 25 /38 variables (removed 13) and now considering 25/38 (removed 13) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-09 11:05:18] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-09 11:05:18] [INFO ] Implicit Places using invariants in 26 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/206 places, 25/171 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 24
Applied a total of 2 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 24/25 (removed 1) transitions.
// Phase 1: matrix 24 rows 23 cols
[2023-03-09 11:05:18] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 11:05:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 11:05:18] [INFO ] Invariant cache hit.
[2023-03-09 11:05:18] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 23/206 places, 24/171 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 312 ms. Remains : 23/206 places, 24/171 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s17 1), p0:(EQ s12 1), p2:(EQ s19 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 15599 reset in 274 ms.
Product exploration explored 100000 steps with 15601 reset in 152 ms.
Computed a total of 19 stabilizing places and 18 stable transitions
Computed a total of 19 stabilizing places and 18 stable transitions
Detected a total of 19/23 stabilizing places and 18/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 322 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 137 steps, including 20 resets, run visited all 3 properties in 3 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2023-03-09 11:05:20] [INFO ] Invariant cache hit.
[2023-03-09 11:05:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 11:05:20] [INFO ] Invariant cache hit.
[2023-03-09 11:05:20] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-09 11:05:20] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-09 11:05:20] [INFO ] Invariant cache hit.
[2023-03-09 11:05:20] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 97 ms. Remains : 23/23 places, 24/24 transitions.
Computed a total of 19 stabilizing places and 18 stable transitions
Computed a total of 19 stabilizing places and 18 stable transitions
Detected a total of 19/23 stabilizing places and 18/24 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 317 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Finished random walk after 21 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0)))]
Knowledge based reduction with 8 factoid took 543 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 15509 reset in 224 ms.
Product exploration explored 100000 steps with 15634 reset in 136 ms.
Built C files in :
/tmp/ltsmin15206433513824010296
[2023-03-09 11:05:22] [INFO ] Computing symmetric may disable matrix : 24 transitions.
[2023-03-09 11:05:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:05:22] [INFO ] Computing symmetric may enable matrix : 24 transitions.
[2023-03-09 11:05:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:05:22] [INFO ] Computing Do-Not-Accords matrix : 24 transitions.
[2023-03-09 11:05:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 11:05:22] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15206433513824010296
Running compilation step : cd /tmp/ltsmin15206433513824010296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 229 ms.
Running link step : cd /tmp/ltsmin15206433513824010296;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15206433513824010296;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10588971544160296195.hoa' '--buchi-type=spotba'
LTSmin run took 94 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-02-LTLFireability-04 finished in 4322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 190 transition count 155
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 190 transition count 155
Applied a total of 32 rules in 7 ms. Remains 190 /206 variables (removed 16) and now considering 155/171 (removed 16) transitions.
// Phase 1: matrix 155 rows 190 cols
[2023-03-09 11:05:22] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-09 11:05:22] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-09 11:05:22] [INFO ] Invariant cache hit.
[2023-03-09 11:05:22] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-09 11:05:22] [INFO ] Invariant cache hit.
[2023-03-09 11:05:22] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/206 places, 155/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 190/206 places, 155/171 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s95 1), p0:(OR (EQ s27 1) (AND (EQ s29 1) (EQ s129 1) (EQ s169 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-05 finished in 509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 109 edges and 206 vertex of which 7 / 206 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 394 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 196 transition count 128
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 164 transition count 128
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 66 place count 164 transition count 90
Deduced a syphon composed of 38 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 150 place count 118 transition count 90
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 161 place count 107 transition count 79
Iterating global reduction 2 with 11 rules applied. Total rules applied 172 place count 107 transition count 79
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 262 place count 61 transition count 35
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 2 with 2 rules applied. Total rules applied 264 place count 60 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 265 place count 59 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 266 place count 58 transition count 33
Applied a total of 266 rules in 26 ms. Remains 58 /206 variables (removed 148) and now considering 33/171 (removed 138) transitions.
// Phase 1: matrix 33 rows 58 cols
[2023-03-09 11:05:23] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 11:05:23] [INFO ] Invariant cache hit.
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [0, 1, 2, 3, 5, 7, 10, 11, 12, 13, 14, 30, 32, 34, 36, 38, 40, 42]
Discarding 18 places :
Implicit Place search using SMT with State Equation took 131 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/206 places, 33/171 transitions.
Graph (complete) has 92 edges and 40 vertex of which 38 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 38 transition count 29
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 35 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 32 transition count 27
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 2 with 2 rules applied. Total rules applied 14 place count 31 transition count 26
Applied a total of 14 rules in 3 ms. Remains 31 /40 variables (removed 9) and now considering 26/33 (removed 7) transitions.
// Phase 1: matrix 26 rows 31 cols
[2023-03-09 11:05:23] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-09 11:05:23] [INFO ] Invariant cache hit.
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/206 places, 26/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 269 ms. Remains : 31/206 places, 26/171 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-08 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 s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-08 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((p1&&F(p2)))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (complete) has 401 edges and 206 vertex of which 203 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 202 transition count 140
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 175 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 173 transition count 138
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 59 place count 173 transition count 95
Deduced a syphon composed of 43 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 153 place count 122 transition count 95
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 165 place count 110 transition count 83
Iterating global reduction 3 with 12 rules applied. Total rules applied 177 place count 110 transition count 83
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 271 place count 62 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 272 place count 62 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 273 place count 61 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 274 place count 60 transition count 35
Applied a total of 274 rules in 28 ms. Remains 60 /206 variables (removed 146) and now considering 35/171 (removed 136) transitions.
// Phase 1: matrix 35 rows 60 cols
[2023-03-09 11:05:23] [INFO ] Computed 26 place invariants in 4 ms
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-09 11:05:23] [INFO ] Invariant cache hit.
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [19, 21, 23, 24, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 192 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/206 places, 35/171 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 30
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 41 transition count 30
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 38 transition count 27
Applied a total of 16 rules in 7 ms. Remains 38 /46 variables (removed 8) and now considering 27/35 (removed 8) transitions.
// Phase 1: matrix 27 rows 38 cols
[2023-03-09 11:05:23] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants in 32 ms returned [10, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/206 places, 27/171 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 25
Applied a total of 4 rules in 2 ms. Remains 34 /36 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 34 cols
[2023-03-09 11:05:23] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 11:05:23] [INFO ] Invariant cache hit.
[2023-03-09 11:05:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [1, 2, 3, 9, 11, 12, 13]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 70 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 27/206 places, 25/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 25 transition count 23
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 25 transition count 23
Applied a total of 4 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 25 cols
[2023-03-09 11:05:23] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-09 11:05:23] [INFO ] Invariant cache hit.
[2023-03-09 11:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 11:05:23] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 25/206 places, 23/171 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 402 ms. Remains : 25/206 places, 23/171 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(AND (EQ s7 1) (EQ s17 1) (EQ s23 1)), p1:(OR (AND (EQ s7 1) (EQ s17 1) (EQ s23 1)) (AND (EQ s2 1) (EQ s14 1) (EQ s23 1))), p0:(AND (EQ s2 1) (EQ s14 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-09 finished in 545 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(F(p1))&&G(p2))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 196 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 196 transition count 161
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 191 transition count 156
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 191 transition count 156
Applied a total of 30 rules in 23 ms. Remains 191 /206 variables (removed 15) and now considering 156/171 (removed 15) transitions.
// Phase 1: matrix 156 rows 191 cols
[2023-03-09 11:05:23] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 11:05:24] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-09 11:05:24] [INFO ] Invariant cache hit.
[2023-03-09 11:05:24] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-09 11:05:24] [INFO ] Invariant cache hit.
[2023-03-09 11:05:24] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 191/206 places, 156/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 191/206 places, 156/171 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p2), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=p2, acceptance={} source=5 dest: 2}]], initial=5, aps=[p2:(EQ s182 1), p0:(EQ s107 1), p1:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-10 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 196 transition count 161
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 196 transition count 161
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 190 transition count 155
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 190 transition count 155
Applied a total of 32 rules in 8 ms. Remains 190 /206 variables (removed 16) and now considering 155/171 (removed 16) transitions.
// Phase 1: matrix 155 rows 190 cols
[2023-03-09 11:05:24] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 11:05:24] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-09 11:05:24] [INFO ] Invariant cache hit.
[2023-03-09 11:05:24] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-09 11:05:24] [INFO ] Invariant cache hit.
[2023-03-09 11:05:24] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/206 places, 155/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 190/206 places, 155/171 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s166 1), p0:(EQ s156 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-11 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0||X(p1)))||X(G(p2))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 189 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 189 transition count 154
Applied a total of 34 rules in 8 ms. Remains 189 /206 variables (removed 17) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 189 cols
[2023-03-09 11:05:25] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 11:05:25] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-09 11:05:25] [INFO ] Invariant cache hit.
[2023-03-09 11:05:25] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-09 11:05:25] [INFO ] Invariant cache hit.
[2023-03-09 11:05:25] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/206 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 421 ms. Remains : 189/206 places, 154/171 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 3}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=6, aps=[p1:(EQ s65 0), p0:(EQ s96 1), p2:(EQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1352 reset in 163 ms.
Product exploration explored 100000 steps with 1359 reset in 170 ms.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 320 ms. Reduced automaton from 9 states, 22 edges and 3 AP (stutter sensitive) to 9 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 133 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 11:05:27] [INFO ] Invariant cache hit.
[2023-03-09 11:05:27] [INFO ] [Real]Absence check using 28 positive place invariants in 7 ms returned sat
[2023-03-09 11:05:27] [INFO ] [Real]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-09 11:05:27] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-03-09 11:05:27] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2023-03-09 11:05:27] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-09 11:05:27] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-09 11:05:27] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-09 11:05:27] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2023-03-09 11:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2023-03-09 11:05:27] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2023-03-09 11:05:27] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 0 ms to minimize.
[2023-03-09 11:05:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-09 11:05:27] [INFO ] After 353ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-09 11:05:27] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 88 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 369 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 181 transition count 122
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 160 transition count 122
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 44 place count 160 transition count 85
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 125 place count 116 transition count 85
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 229 place count 63 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 63 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 62 transition count 33
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 62 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 61 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 60 transition count 32
Applied a total of 234 rules in 23 ms. Remains 60 /189 variables (removed 129) and now considering 32/154 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 60/189 places, 32/154 transitions.
Incomplete random walk after 10000 steps, including 430 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Finished Best-First random walk after 62 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p1 p2 p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p2) p0)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) (NOT p2))), (F p2), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p2)), (F (AND p2 (NOT p0))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT p1)), (F (AND p1 p0)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 7 factoid took 828 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 316 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
[2023-03-09 11:05:29] [INFO ] Invariant cache hit.
[2023-03-09 11:05:29] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-09 11:05:29] [INFO ] Invariant cache hit.
[2023-03-09 11:05:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-09 11:05:29] [INFO ] Invariant cache hit.
[2023-03-09 11:05:29] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 189/189 places, 154/154 transitions.
Computed a total of 182 stabilizing places and 145 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 182 stabilizing places and 145 stable transitions
Detected a total of 182/189 stabilizing places and 145/154 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 226 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 134 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-09 11:05:30] [INFO ] Invariant cache hit.
[2023-03-09 11:05:30] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-09 11:05:30] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-09 11:05:30] [INFO ] [Nat]Absence check using 28 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-09 11:05:30] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-09 11:05:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2023-03-09 11:05:30] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2023-03-09 11:05:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2023-03-09 11:05:30] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2023-03-09 11:05:30] [INFO ] Deduced a trap composed of 38 places in 39 ms of which 0 ms to minimize.
[2023-03-09 11:05:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2023-03-09 11:05:30] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-09 11:05:30] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 88 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 369 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 181 transition count 122
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 44 place count 160 transition count 122
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 44 place count 160 transition count 85
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 125 place count 116 transition count 85
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 229 place count 63 transition count 34
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 63 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 231 place count 62 transition count 33
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 232 place count 62 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 233 place count 61 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 234 place count 60 transition count 32
Applied a total of 234 rules in 16 ms. Remains 60 /189 variables (removed 129) and now considering 32/154 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 60/189 places, 32/154 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Finished Best-First random walk after 132 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), true, (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p2), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F (NOT p1)), (F (AND p1 p0)), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (AND p1 p2))]
Knowledge based reduction with 5 factoid took 518 ms. Reduced automaton from 8 states, 16 edges and 3 AP (stutter sensitive) to 8 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 338 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 324 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1363 reset in 205 ms.
Product exploration explored 100000 steps with 1370 reset in 203 ms.
Applying partial POR strategy [true, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Graph (trivial) has 88 edges and 189 vertex of which 6 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 370 edges and 184 vertex of which 181 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 181 transition count 145
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 23 place count 181 transition count 167
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 53 place count 181 transition count 167
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 174 transition count 154
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 174 transition count 154
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 123 place count 174 transition count 154
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 138 place count 159 transition count 139
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 153 place count 159 transition count 139
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 153 rules in 28 ms. Remains 159 /189 variables (removed 30) and now considering 139/154 (removed 15) transitions.
[2023-03-09 11:05:33] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 139 rows 159 cols
[2023-03-09 11:05:33] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-09 11:05:33] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/189 places, 139/154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 159/189 places, 139/154 transitions.
Built C files in :
/tmp/ltsmin14479995144848053367
[2023-03-09 11:05:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14479995144848053367
Running compilation step : cd /tmp/ltsmin14479995144848053367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin14479995144848053367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin14479995144848053367;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10235719735846466501.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 154/154 transitions.
Applied a total of 0 rules in 16 ms. Remains 189 /189 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 189 cols
[2023-03-09 11:05:48] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-09 11:05:48] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-09 11:05:48] [INFO ] Invariant cache hit.
[2023-03-09 11:05:48] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-09 11:05:48] [INFO ] Invariant cache hit.
[2023-03-09 11:05:48] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 189/189 places, 154/154 transitions.
Built C files in :
/tmp/ltsmin8020118064809293384
[2023-03-09 11:05:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8020118064809293384
Running compilation step : cd /tmp/ltsmin8020118064809293384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin8020118064809293384;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin8020118064809293384;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4875843098000105783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 11:06:04] [INFO ] Flatten gal took : 14 ms
[2023-03-09 11:06:04] [INFO ] Flatten gal took : 18 ms
[2023-03-09 11:06:04] [INFO ] Time to serialize gal into /tmp/LTL12594143885735139928.gal : 5 ms
[2023-03-09 11:06:04] [INFO ] Time to serialize properties into /tmp/LTL13829370655388473256.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12594143885735139928.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5958002246346356162.hoa' '-atoms' '/tmp/LTL13829370655388473256.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13829370655388473256.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5958002246346356162.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t28, t33, t39, t42, t45, t48, t52, t55, t58, t61, t64, t67, t76, t81, t82, t84, t86, t89,...344
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2023-03-09 11:06:19] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:06:19] [INFO ] Flatten gal took : 9 ms
[2023-03-09 11:06:19] [INFO ] Time to serialize gal into /tmp/LTL200810934103155350.gal : 2 ms
[2023-03-09 11:06:19] [INFO ] Time to serialize properties into /tmp/LTL1662340602960825069.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL200810934103155350.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1662340602960825069.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X((G(("(p111==1)")||(X("(p77==0)"))))||(X(G("(p130==1)")))))))
Formula 0 simplified : XX(F(!"(p111==1)" & X!"(p77==0)") & XF!"(p130==1)")
Reverse transition relation is NOT exact ! Due to transitions t2, t28, t33, t39, t42, t45, t48, t52, t55, t58, t61, t64, t67, t76, t81, t82, t84, t86, t89,...344
Computing Next relation with stutter on 41 deadlock states
Detected timeout of ITS tools.
[2023-03-09 11:06:34] [INFO ] Flatten gal took : 6 ms
[2023-03-09 11:06:34] [INFO ] Applying decomposition
[2023-03-09 11:06:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16728072796663988765.txt' '-o' '/tmp/graph16728072796663988765.bin' '-w' '/tmp/graph16728072796663988765.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16728072796663988765.bin' '-l' '-1' '-v' '-w' '/tmp/graph16728072796663988765.weights' '-q' '0' '-e' '0.001'
[2023-03-09 11:06:34] [INFO ] Decomposing Gal with order
[2023-03-09 11:06:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 11:06:34] [INFO ] Removed a total of 32 redundant transitions.
[2023-03-09 11:06:34] [INFO ] Flatten gal took : 47 ms
[2023-03-09 11:06:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2023-03-09 11:06:34] [INFO ] Time to serialize gal into /tmp/LTL2056719194638559134.gal : 24 ms
[2023-03-09 11:06:34] [INFO ] Time to serialize properties into /tmp/LTL5484995157348017338.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2056719194638559134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5484995157348017338.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G(("(i12.u37.p111==1)")||(X("(i1.u24.p77==0)"))))||(X(G("(i9.i1.u39.p130==1)")))))))
Formula 0 simplified : XX(F(!"(i12.u37.p111==1)" & X!"(i1.u24.p77==0)") & XF!"(i9.i1.u39.p130==1)")
Reverse transition relation is NOT exact ! Due to transitions t110, t122, t128, i0.i0.u52.t42, i0.i0.u53.t39, i1.u21.t105, i1.u23.t101, i2.u27.t93, i3.t116...588
Computing Next relation with stutter on 41 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
75 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,0.77486,55112,1,0,90956,636,2589,110810,249,2206,270009
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-02-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-02-LTLFireability-12 finished in 70498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X(p2)&&p1))))'
Support contains 8 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 195 transition count 160
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 195 transition count 160
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 189 transition count 154
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 189 transition count 154
Applied a total of 34 rules in 7 ms. Remains 189 /206 variables (removed 17) and now considering 154/171 (removed 17) transitions.
// Phase 1: matrix 154 rows 189 cols
[2023-03-09 11:06:35] [INFO ] Computed 37 place invariants in 3 ms
[2023-03-09 11:06:35] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 11:06:35] [INFO ] Invariant cache hit.
[2023-03-09 11:06:35] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-09 11:06:35] [INFO ] Invariant cache hit.
[2023-03-09 11:06:35] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/206 places, 154/171 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 189/206 places, 154/171 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s126 0) (EQ s182 0)), p2:(OR (EQ s39 0) (EQ s150 0) (EQ s182 0)), p1:(AND (EQ s157 1) (EQ s99 1) (EQ s144 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 136 ms.
Computed a total of 181 stabilizing places and 144 stable transitions
Graph (complete) has 376 edges and 189 vertex of which 186 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 181 stabilizing places and 144 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-02-LTLFireability-13 finished in 981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1||G(p2))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 171/171 transitions.
Graph (trivial) has 105 edges and 206 vertex of which 7 / 206 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 394 edges and 200 vertex of which 197 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 196 transition count 130
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 62 place count 166 transition count 130
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 62 place count 166 transition count 93
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 81 rules applied. Total rules applied 143 place count 122 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 153 place count 112 transition count 83
Iterating global reduction 2 with 10 rules applied. Total rules applied 163 place count 112 transition count 83
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 253 place count 67 transition count 38
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 2 with 2 rules applied. Total rules applied 255 place count 66 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 256 place count 65 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 64 transition count 36
Applied a total of 257 rules in 18 ms. Remains 64 /206 variables (removed 142) and now considering 36/171 (removed 135) transitions.
// Phase 1: matrix 36 rows 64 cols
[2023-03-09 11:06:36] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-09 11:06:36] [INFO ] Implicit Places using invariants in 52 ms returned [4, 60, 62]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 53 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/206 places, 36/171 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 61/206 places, 36/171 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s51 1), p2:(EQ s2 1), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-02-LTLFireability-15 finished in 268 ms.
All properties solved by simple procedures.
Total runtime 82889 ms.

BK_STOP 1678359996987

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-02"
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-5348"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-02, 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 r037-tajo-167813690400460"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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