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.r039-tajo-167813692600500.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 lolaxred
Input is BusinessProcesses-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 16:42 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 26K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K 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.8K 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 100K 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-07-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678502096509

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 02:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:34:58] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-11 02:34:58] [INFO ] Transformed 386 places.
[2023-03-11 02:34:58] [INFO ] Transformed 360 transitions.
[2023-03-11 02:34:58] [INFO ] Found NUPN structural information;
[2023-03-11 02:34:58] [INFO ] Parsed PT model containing 386 places and 360 transitions and 1110 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Support contains 53 out of 386 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 386/386 places, 360/360 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 385 transition count 360
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 335 transition count 310
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 335 transition count 310
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 123 place count 313 transition count 288
Iterating global reduction 1 with 22 rules applied. Total rules applied 145 place count 313 transition count 288
Applied a total of 145 rules in 59 ms. Remains 313 /386 variables (removed 73) and now considering 288/360 (removed 72) transitions.
// Phase 1: matrix 288 rows 313 cols
[2023-03-11 02:34:58] [INFO ] Computed 61 place invariants in 23 ms
[2023-03-11 02:34:58] [INFO ] Implicit Places using invariants in 302 ms returned []
[2023-03-11 02:34:58] [INFO ] Invariant cache hit.
[2023-03-11 02:34:59] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2023-03-11 02:34:59] [INFO ] Invariant cache hit.
[2023-03-11 02:34:59] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 313/386 places, 288/360 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 855 ms. Remains : 313/386 places, 288/360 transitions.
Support contains 53 out of 313 places after structural reductions.
[2023-03-11 02:34:59] [INFO ] Flatten gal took : 52 ms
[2023-03-11 02:34:59] [INFO ] Flatten gal took : 21 ms
[2023-03-11 02:34:59] [INFO ] Input system was already deterministic with 288 transitions.
Incomplete random walk after 10000 steps, including 108 resets, run finished after 386 ms. (steps per millisecond=25 ) properties (out of 37) seen :23
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-11 02:35:00] [INFO ] Invariant cache hit.
[2023-03-11 02:35:00] [INFO ] [Real]Absence check using 32 positive place invariants in 29 ms returned sat
[2023-03-11 02:35:00] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 11 ms returned sat
[2023-03-11 02:35:00] [INFO ] After 432ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-11 02:35:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-11 02:35:00] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 20 ms returned sat
[2023-03-11 02:35:00] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 4 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-11 02:35:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 312 ms
[2023-03-11 02:35:01] [INFO ] After 706ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 02:35:01] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 23 ms.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 136 edges and 313 vertex of which 7 / 313 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 723 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 306 transition count 251
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 59 place count 278 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 277 transition count 250
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 60 place count 277 transition count 190
Deduced a syphon composed of 60 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 129 rules applied. Total rules applied 189 place count 208 transition count 190
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 195 place count 202 transition count 184
Iterating global reduction 3 with 6 rules applied. Total rules applied 201 place count 202 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 201 place count 202 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 205 place count 200 transition count 182
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 353 place count 125 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 124 transition count 112
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 124 transition count 110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 359 place count 122 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 360 place count 122 transition count 110
Applied a total of 360 rules in 57 ms. Remains 122 /313 variables (removed 191) and now considering 110/288 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 122/313 places, 110/288 transitions.
Finished random walk after 104 steps, including 7 resets, run visited all 4 properties in 2 ms. (steps per millisecond=52 )
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-07-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 194 stabilizing places and 196 stable transitions
Graph (complete) has 731 edges and 313 vertex of which 312 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 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||G(p1)))||F(p2))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 304 transition count 279
Applied a total of 18 rules in 26 ms. Remains 304 /313 variables (removed 9) and now considering 279/288 (removed 9) transitions.
// Phase 1: matrix 279 rows 304 cols
[2023-03-11 02:35:02] [INFO ] Computed 61 place invariants in 7 ms
[2023-03-11 02:35:02] [INFO ] Implicit Places using invariants in 228 ms returned []
[2023-03-11 02:35:02] [INFO ] Invariant cache hit.
[2023-03-11 02:35:02] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-11 02:35:02] [INFO ] Invariant cache hit.
[2023-03-11 02:35:02] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/313 places, 279/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 653 ms. Remains : 304/313 places, 279/288 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s105 0) (EQ s184 0) (EQ s257 0)), p2:(EQ s239 1), p0:(EQ s50 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]]
Stuttering criterion allowed to conclude after 15449 steps with 171 reset in 72 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-00 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 9 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
// Phase 1: matrix 278 rows 303 cols
[2023-03-11 02:35:03] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-11 02:35:03] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-11 02:35:03] [INFO ] Invariant cache hit.
[2023-03-11 02:35:03] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-11 02:35:03] [INFO ] Invariant cache hit.
[2023-03-11 02:35:03] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s45 1) (EQ s192 1) (EQ s272 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-01 finished in 657 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(!p0))) U X(p1))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 10 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
[2023-03-11 02:35:03] [INFO ] Invariant cache hit.
[2023-03-11 02:35:03] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-11 02:35:03] [INFO ] Invariant cache hit.
[2023-03-11 02:35:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-11 02:35:03] [INFO ] Invariant cache hit.
[2023-03-11 02:35:04] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 434 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), true, p0]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(NEQ s290 1), p1:(NEQ s74 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 221 ms.
Product exploration explored 100000 steps with 33333 reset in 294 ms.
Computed a total of 186 stabilizing places and 188 stable transitions
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 186 stabilizing places and 188 stable transitions
Detected a total of 186/303 stabilizing places and 188/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 170 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-02 finished in 1343 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((G(p1) U p2))) U p3)))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 304 transition count 279
Applied a total of 18 rules in 14 ms. Remains 304 /313 variables (removed 9) and now considering 279/288 (removed 9) transitions.
// Phase 1: matrix 279 rows 304 cols
[2023-03-11 02:35:05] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-11 02:35:05] [INFO ] Invariant cache hit.
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-11 02:35:05] [INFO ] Invariant cache hit.
[2023-03-11 02:35:05] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/313 places, 279/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 513 ms. Remains : 304/313 places, 279/288 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p3), (NOT p3), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 4}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s72 1) (EQ s255 1)), p0:(AND (EQ s152 1) (EQ s72 1) (EQ s255 1)), p2:(EQ s152 1), p1:(EQ s239 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-03 finished in 736 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 U p1)||F((G(p2)||(p2&&F(!p1)))))))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 306 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 306 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 304 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 304 transition count 279
Applied a total of 18 rules in 16 ms. Remains 304 /313 variables (removed 9) and now considering 279/288 (removed 9) transitions.
// Phase 1: matrix 279 rows 304 cols
[2023-03-11 02:35:05] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-11 02:35:05] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-11 02:35:05] [INFO ] Invariant cache hit.
[2023-03-11 02:35:06] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-11 02:35:06] [INFO ] Invariant cache hit.
[2023-03-11 02:35:06] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/313 places, 279/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 304/313 places, 279/288 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s192 1) (EQ s273 1)), p0:(AND (EQ s21 1) (EQ s168 1) (EQ s241 1)), p2:(NEQ s221 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2645 reset in 181 ms.
Stack based approach found an accepted trace after 9518 steps with 277 reset with depth 31 and stack size 31 in 27 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-05 finished in 1038 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||X(F((p0&&F(p1))))))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 306 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 306 transition count 281
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 304 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 304 transition count 279
Applied a total of 18 rules in 15 ms. Remains 304 /313 variables (removed 9) and now considering 279/288 (removed 9) transitions.
// Phase 1: matrix 279 rows 304 cols
[2023-03-11 02:35:06] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-11 02:35:06] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-11 02:35:06] [INFO ] Invariant cache hit.
[2023-03-11 02:35:07] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-11 02:35:07] [INFO ] Invariant cache hit.
[2023-03-11 02:35:07] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 304/313 places, 279/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 599 ms. Remains : 304/313 places, 279/288 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s214 1), p1:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-06 finished in 751 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((F(p0)||X(X(F(p1)))))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 10 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
// Phase 1: matrix 278 rows 303 cols
[2023-03-11 02:35:07] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-11 02:35:07] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-11 02:35:07] [INFO ] Invariant cache hit.
[2023-03-11 02:35:07] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2023-03-11 02:35:07] [INFO ] Invariant cache hit.
[2023-03-11 02:35:08] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 500 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s158 1), p1:(EQ s24 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 1645 reset in 177 ms.
Stack based approach found an accepted trace after 2726 steps with 45 reset with depth 51 and stack size 51 in 6 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-07 finished in 834 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(p0))'
Support contains 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 142 edges and 313 vertex of which 7 / 313 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 724 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 305 transition count 248
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 274 transition count 248
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 64 place count 274 transition count 186
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 197 place count 203 transition count 186
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 197 transition count 180
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 197 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 209 place count 197 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 195 transition count 178
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 363 place count 119 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 365 place count 118 transition count 107
Applied a total of 365 rules in 51 ms. Remains 118 /313 variables (removed 195) and now considering 107/288 (removed 181) transitions.
// Phase 1: matrix 107 rows 118 cols
[2023-03-11 02:35:08] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-11 02:35:08] [INFO ] Implicit Places using invariants in 213 ms returned [1, 2, 3, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 216 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/313 places, 107/288 transitions.
Applied a total of 0 rules in 8 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 275 ms. Remains : 107/313 places, 107/288 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-08 finished in 340 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 1 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 142 edges and 313 vertex of which 7 / 313 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 724 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 33 place count 305 transition count 248
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 64 place count 274 transition count 248
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 64 place count 274 transition count 186
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 197 place count 203 transition count 186
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 203 place count 197 transition count 180
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 197 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 209 place count 197 transition count 178
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 195 transition count 178
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 364 place count 118 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 366 place count 117 transition count 107
Applied a total of 366 rules in 32 ms. Remains 117 /313 variables (removed 196) and now considering 107/288 (removed 181) transitions.
// Phase 1: matrix 107 rows 117 cols
[2023-03-11 02:35:08] [INFO ] Computed 49 place invariants in 0 ms
[2023-03-11 02:35:08] [INFO ] Implicit Places using invariants in 71 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40, 41]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 72 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/313 places, 107/288 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 107/313 places, 107/288 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s66 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 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-09 finished in 143 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 141 edges and 313 vertex of which 7 / 313 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 724 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 305 transition count 249
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 275 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 274 transition count 248
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 64 place count 274 transition count 186
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 197 place count 203 transition count 186
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 204 place count 196 transition count 179
Iterating global reduction 3 with 7 rules applied. Total rules applied 211 place count 196 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 211 place count 196 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 215 place count 194 transition count 177
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 147 rules applied. Total rules applied 362 place count 119 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 364 place count 118 transition count 108
Applied a total of 364 rules in 23 ms. Remains 118 /313 variables (removed 195) and now considering 108/288 (removed 180) transitions.
// Phase 1: matrix 108 rows 118 cols
[2023-03-11 02:35:08] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-11 02:35:08] [INFO ] Implicit Places using invariants in 73 ms returned [1, 2, 10, 35, 36, 37, 38, 39, 40]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 74 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 109/313 places, 108/288 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 109/313 places, 108/288 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s33 0), p1:(EQ s88 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20075 reset in 272 ms.
Product exploration explored 100000 steps with 20169 reset in 266 ms.
Computed a total of 65 stabilizing places and 79 stable transitions
Computed a total of 65 stabilizing places and 79 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 260 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 670 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 108 rows 109 cols
[2023-03-11 02:35:09] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-11 02:35:09] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:35:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-11 02:35:09] [INFO ] [Nat]Absence check using 23 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-11 02:35:09] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:35:09] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:10] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2023-03-11 02:35:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-11 02:35:10] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-11 02:35:10] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 108/108 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 109 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 109 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 107 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 105
Applied a total of 6 rules in 9 ms. Remains 107 /109 variables (removed 2) and now considering 105/108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 107/109 places, 105/108 transitions.
Incomplete random walk after 10000 steps, including 684 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished Best-First random walk after 208 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 24 ms :[(AND (NOT p0) (NOT p1))]
Support contains 2 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 109 /109 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-11 02:35:10] [INFO ] Invariant cache hit.
[2023-03-11 02:35:10] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 02:35:10] [INFO ] Invariant cache hit.
[2023-03-11 02:35:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-11 02:35:10] [INFO ] Implicit Places using invariants and state equation in 108 ms returned [10, 36, 58, 60, 66, 68]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 195 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/109 places, 108/108 transitions.
Graph (complete) has 393 edges and 103 vertex of which 94 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 94 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 93 transition count 103
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 13 place count 83 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 83 transition count 65
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 82 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 82 transition count 64
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 2 with 4 rules applied. Total rules applied 29 place count 80 transition count 62
Applied a total of 29 rules in 11 ms. Remains 80 /103 variables (removed 23) and now considering 62/108 (removed 46) transitions.
// Phase 1: matrix 62 rows 80 cols
[2023-03-11 02:35:10] [INFO ] Computed 29 place invariants in 0 ms
[2023-03-11 02:35:10] [INFO ] Implicit Places using invariants in 60 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 61 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/109 places, 62/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 274 ms. Remains : 77/109 places, 62/108 transitions.
Computed a total of 33 stabilizing places and 33 stable transitions
Computed a total of 33 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 221 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 21 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2340 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 716 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 77 cols
[2023-03-11 02:35:11] [INFO ] Computed 26 place invariants in 0 ms
[2023-03-11 02:35:11] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:35:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 1 ms returned sat
[2023-03-11 02:35:11] [INFO ] [Nat]Absence check using 17 positive and 9 generalized place invariants in 2 ms returned sat
[2023-03-11 02:35:11] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:35:11] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 02:35:11] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 02:35:11] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 62/62 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 61
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 77 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 75 transition count 59
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 75 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 72 transition count 56
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 72 transition count 56
Applied a total of 13 rules in 8 ms. Remains 72 /77 variables (removed 5) and now considering 56/62 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 72/77 places, 56/62 transitions.
Finished random walk after 959 steps, including 79 resets, run visited all 1 properties in 3 ms. (steps per millisecond=319 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 255 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 20 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 21 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 20 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 20787 reset in 111 ms.
Product exploration explored 100000 steps with 20632 reset in 118 ms.
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-11 02:35:11] [INFO ] Invariant cache hit.
[2023-03-11 02:35:11] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 02:35:11] [INFO ] Invariant cache hit.
[2023-03-11 02:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:35:11] [INFO ] Implicit Places using invariants and state equation in 70 ms returned [33, 36, 38]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 148 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/77 places, 62/62 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 3 place count 74 transition count 59
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 71 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 70 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 70 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 70 transition count 57
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 23 rules applied. Total rules applied 32 place count 56 transition count 48
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 35 place count 53 transition count 45
Iterating global reduction 3 with 3 rules applied. Total rules applied 38 place count 53 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 39 place count 53 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 52 transition count 43
Applied a total of 41 rules in 13 ms. Remains 52 /74 variables (removed 22) and now considering 43/62 (removed 19) transitions.
// Phase 1: matrix 43 rows 52 cols
[2023-03-11 02:35:11] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-11 02:35:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 02:35:11] [INFO ] Invariant cache hit.
[2023-03-11 02:35:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 02:35:11] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/77 places, 43/62 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 256 ms. Remains : 52/77 places, 43/62 transitions.
Treatment of property BusinessProcesses-PT-07-LTLFireability-10 finished in 3171 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((X(G((p1&&(p2 U (p3||G(p2))))))&&p0))))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 15 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
// Phase 1: matrix 278 rows 303 cols
[2023-03-11 02:35:12] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-11 02:35:12] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-11 02:35:12] [INFO ] Invariant cache hit.
[2023-03-11 02:35:12] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-11 02:35:12] [INFO ] Invariant cache hit.
[2023-03-11 02:35:12] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-11 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: 3}], [{ cond=(OR (NOT p0) (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 0}, { cond=(OR (AND p0 p1 p3) (AND p0 p1 p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s72 1) (EQ s254 1)), p1:(OR (EQ s213 1) (AND (EQ s72 1) (EQ s254 1))), p3:(AND (NOT (AND (EQ s81 1) (EQ s220 1) (EQ s253 1))) (EQ s150 1)), p2...], 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-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-11 finished in 886 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)) U p1))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 306 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 306 transition count 281
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 305 transition count 280
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 305 transition count 280
Applied a total of 16 rules in 13 ms. Remains 305 /313 variables (removed 8) and now considering 280/288 (removed 8) transitions.
// Phase 1: matrix 280 rows 305 cols
[2023-03-11 02:35:12] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-11 02:35:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-11 02:35:13] [INFO ] Invariant cache hit.
[2023-03-11 02:35:13] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2023-03-11 02:35:13] [INFO ] Invariant cache hit.
[2023-03-11 02:35:13] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/313 places, 280/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 305/313 places, 280/288 transitions.
Stuttering acceptance computed with spot in 100 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s252 1), p1:(OR (EQ s11 1) (EQ s251 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4275 steps with 47 reset in 7 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-13 finished in 595 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 U (G((p0||G(p1)))||(p2&&(p0||G(p1)))))))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 305 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 305 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 303 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 303 transition count 278
Applied a total of 20 rules in 12 ms. Remains 303 /313 variables (removed 10) and now considering 278/288 (removed 10) transitions.
// Phase 1: matrix 278 rows 303 cols
[2023-03-11 02:35:13] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-11 02:35:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-11 02:35:13] [INFO ] Invariant cache hit.
[2023-03-11 02:35:13] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-11 02:35:13] [INFO ] Invariant cache hit.
[2023-03-11 02:35:13] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/313 places, 278/288 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 303/313 places, 278/288 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(NEQ s236 1), p1:(EQ s247 1), p2:(NEQ s189 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 233 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 186 stabilizing places and 188 stable transitions
Graph (complete) has 719 edges and 303 vertex of which 302 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 186 stabilizing places and 188 stable transitions
Detected a total of 186/303 stabilizing places and 188/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1) p2)
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-07-LTLFireability-14 finished in 1309 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 U p1))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 288/288 transitions.
Graph (trivial) has 142 edges and 313 vertex of which 7 / 313 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 724 edges and 307 vertex of which 306 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 305 transition count 247
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 66 place count 273 transition count 247
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 66 place count 273 transition count 185
Deduced a syphon composed of 62 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 133 rules applied. Total rules applied 199 place count 202 transition count 185
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 205 place count 196 transition count 179
Iterating global reduction 2 with 6 rules applied. Total rules applied 211 place count 196 transition count 179
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 211 place count 196 transition count 178
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 213 place count 195 transition count 178
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 364 place count 118 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 366 place count 117 transition count 107
Applied a total of 366 rules in 22 ms. Remains 117 /313 variables (removed 196) and now considering 107/288 (removed 181) transitions.
// Phase 1: matrix 107 rows 117 cols
[2023-03-11 02:35:14] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-11 02:35:14] [INFO ] Implicit Places using invariants in 89 ms returned [1, 2, 11, 36, 37, 38, 39, 40, 41, 42]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 90 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/313 places, 107/288 transitions.
Applied a total of 0 rules in 2 ms. Remains 107 /107 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 115 ms. Remains : 107/313 places, 107/288 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 1), p0:(EQ s60 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-07-LTLFireability-15 finished in 186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-11 02:35:15] [INFO ] Flatten gal took : 20 ms
[2023-03-11 02:35:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 02:35:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 288 transitions and 965 arcs took 2 ms.
Total runtime 17111 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT BusinessProcesses-PT-07
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA BusinessProcesses-PT-07-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678502115908

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 BusinessProcesses-PT-07-LTLFireability-10
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for BusinessProcesses-PT-07-LTLFireability-10
lola: result : false
lola: markings : 152662
lola: fired transitions : 402079
lola: time used : 0.000000
lola: memory pages used : 2
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
BusinessProcesses-PT-07-LTLFireability-10: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 2

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-07"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is BusinessProcesses-PT-07, 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 r039-tajo-167813692600500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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