Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r233-tall-167856419100620.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is MAPK-PT-05120, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419100620
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-05120-LTLFireability-00
FORMULA_NAME MAPK-PT-05120-LTLFireability-01
FORMULA_NAME MAPK-PT-05120-LTLFireability-02
FORMULA_NAME MAPK-PT-05120-LTLFireability-03
FORMULA_NAME MAPK-PT-05120-LTLFireability-04
FORMULA_NAME MAPK-PT-05120-LTLFireability-05
FORMULA_NAME MAPK-PT-05120-LTLFireability-06
FORMULA_NAME MAPK-PT-05120-LTLFireability-07
FORMULA_NAME MAPK-PT-05120-LTLFireability-08
FORMULA_NAME MAPK-PT-05120-LTLFireability-09
FORMULA_NAME MAPK-PT-05120-LTLFireability-10
FORMULA_NAME MAPK-PT-05120-LTLFireability-11
FORMULA_NAME MAPK-PT-05120-LTLFireability-12
FORMULA_NAME MAPK-PT-05120-LTLFireability-13
FORMULA_NAME MAPK-PT-05120-LTLFireability-14
FORMULA_NAME MAPK-PT-05120-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679567984030

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-05120
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 10:39:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 10:39:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 10:39:45] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-23 10:39:45] [INFO ] Transformed 22 places.
[2023-03-23 10:39:45] [INFO ] Transformed 30 transitions.
[2023-03-23 10:39:45] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MAPK-PT-05120-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 93 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 10:39:46] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-23 10:39:46] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-23 10:39:46] [INFO ] Invariant cache hit.
[2023-03-23 10:39:46] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-23 10:39:46] [INFO ] Invariant cache hit.
[2023-03-23 10:39:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 19 out of 22 places after structural reductions.
[2023-03-23 10:39:46] [INFO ] Flatten gal took : 18 ms
[2023-03-23 10:39:46] [INFO ] Flatten gal took : 5 ms
[2023-03-23 10:39:46] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10250 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=366 ) properties (out of 21) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 9) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-23 10:39:46] [INFO ] Invariant cache hit.
[2023-03-23 10:39:46] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-23 10:39:46] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-23 10:39:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-23 10:39:46] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-23 10:39:46] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-23 10:39:46] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 953 ms.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
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 4 places and 0 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 16 transition count 25
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 14 place count 16 transition count 22
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 16 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 16 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 15 transition count 17
Applied a total of 20 rules in 14 ms. Remains 15 /22 variables (removed 7) and now considering 17/30 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 15/22 places, 17/30 transitions.
Incomplete random walk after 10243 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1707 ) properties (out of 2) seen :0
Finished Best-First random walk after 512 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=256 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 14 transition count 25
Graph (trivial) has 8 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 13 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 13 transition count 22
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 13 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 13 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 13 transition count 18
Applied a total of 22 rules in 9 ms. Remains 13 /22 variables (removed 9) and now considering 18/30 (removed 12) transitions.
[2023-03-23 10:39:48] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
// Phase 1: matrix 16 rows 13 cols
[2023-03-23 10:39:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-23 10:39:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 10:39:48] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2023-03-23 10:39:48] [INFO ] Invariant cache hit.
[2023-03-23 10:39:48] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-23 10:39:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 10:39:48] [INFO ] Flow matrix only has 16 transitions (discarded 2 similar events)
[2023-03-23 10:39:48] [INFO ] Invariant cache hit.
[2023-03-23 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 18/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 13/22 places, 18/30 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-00 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:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-05120-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-00 finished in 355 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) U p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 10:39:48] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 10:39:48] [INFO ] Implicit Places using invariants in 39 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s5 1) (OR (GEQ s1 1) (GEQ s17 1))), p0:(GEQ s1 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-01 finished in 210 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((X(X(p1))&&p0)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 10:39:48] [INFO ] Invariant cache hit.
[2023-03-23 10:39:48] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 229 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 4}]], initial=2, aps=[p0:(AND (LT s16 1) (OR (LT s8 1) (LT s14 1))), p1:(OR (LT s8 1) (LT s14 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-02 finished in 287 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 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 8 transition count 14
Applied a total of 30 rules in 7 ms. Remains 8 /22 variables (removed 14) and now considering 14/30 (removed 16) transitions.
[2023-03-23 10:39:48] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2023-03-23 10:39:48] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 10:39:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-23 10:39:48] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2023-03-23 10:39:48] [INFO ] Invariant cache hit.
[2023-03-23 10:39:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:39:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-23 10:39:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 10:39:48] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2023-03-23 10:39:48] [INFO ] Invariant cache hit.
[2023-03-23 10:39:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 14/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 8/22 places, 14/30 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s6 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 0 ms.
FORMULA MAPK-PT-05120-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-03 finished in 149 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 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 13 transition count 24
Graph (trivial) has 8 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 11 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 22 place count 9 transition count 20
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 9 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 9 transition count 12
Applied a total of 31 rules in 9 ms. Remains 9 /22 variables (removed 13) and now considering 12/30 (removed 18) transitions.
// Phase 1: matrix 12 rows 9 cols
[2023-03-23 10:39:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-23 10:39:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-23 10:39:49] [INFO ] Invariant cache hit.
[2023-03-23 10:39:49] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-23 10:39:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 10:39:49] [INFO ] Invariant cache hit.
[2023-03-23 10:39:49] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 12/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 9/22 places, 12/30 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-04 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:(AND (OR (LT s4 1) (LT s5 1)) (OR (LT s5 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-04 finished in 189 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((X(p0)&&(p1||G(p2)))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 10:39:49] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 10:39:49] [INFO ] Implicit Places using invariants in 38 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 7 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s18 1) (GEQ s19 1)), p2:(AND (GEQ s6 1) (GEQ s7 1)), p0:(GEQ s1 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 MAPK-PT-05120-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-05 finished in 219 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))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 10:39:49] [INFO ] Invariant cache hit.
[2023-03-23 10:39:49] [INFO ] Implicit Places using invariants in 40 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s10 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][false, false, false]]
Product exploration explored 100000 steps with 417 reset in 252 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 2 ms.
FORMULA MAPK-PT-05120-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLFireability-06 finished in 431 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)&&X((X(X(p1)) U (!p0&&X(X(p1)))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 10:39:49] [INFO ] Invariant cache hit.
[2023-03-23 10:39:49] [INFO ] Implicit Places using invariants in 39 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (OR (NOT p1) p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s11 1), p1:(LT s4 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19982 reset in 118 ms.
Stack based approach found an accepted trace after 34 steps with 8 reset with depth 3 and stack size 3 in 1 ms.
FORMULA MAPK-PT-05120-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLFireability-07 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 10:39:50] [INFO ] Invariant cache hit.
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s16 1), p0:(AND (GEQ s15 1) (GEQ s5 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-08 finished in 133 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((G(p1) U p2))||p0)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
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 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 15 transition count 25
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 15 transition count 23
Applied a total of 14 rules in 6 ms. Remains 15 /22 variables (removed 7) and now considering 23/30 (removed 7) transitions.
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 15 cols
[2023-03-23 10:39:50] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-23 10:39:50] [INFO ] Invariant cache hit.
[2023-03-23 10:39:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-23 10:39:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-23 10:39:50] [INFO ] Invariant cache hit.
[2023-03-23 10:39:50] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 23/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 15/22 places, 23/30 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s8 1) (AND (GEQ s0 1) (GEQ s11 1))), p2:(AND (GEQ s0 1) (GEQ s11 1)), p1:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-09 finished in 276 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 (p1 U p2))&&X(G(F(p1))))) U p2))'
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 17 transition count 25
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 16 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 16 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 16 transition count 23
Applied a total of 15 rules in 9 ms. Remains 16 /22 variables (removed 6) and now considering 23/30 (removed 7) transitions.
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 20 transitions (discarded 3 similar events)
// Phase 1: matrix 20 rows 16 cols
[2023-03-23 10:39:50] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 23/30 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 22
Applied a total of 1 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 22/23 (removed 1) transitions.
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-23 10:39:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
[2023-03-23 10:39:50] [INFO ] Invariant cache hit.
[2023-03-23 10:39:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/22 places, 22/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95 ms. Remains : 15/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (OR (NOT p2) p1), p1]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s1 1), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-10 finished in 229 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||X(F((!p0&&F(p1))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 14 transition count 24
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 14 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 14 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 14 transition count 19
Applied a total of 20 rules in 9 ms. Remains 14 /22 variables (removed 8) and now considering 19/30 (removed 11) transitions.
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
// Phase 1: matrix 17 rows 14 cols
[2023-03-23 10:39:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-23 10:39:50] [INFO ] Invariant cache hit.
[2023-03-23 10:39:50] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 10:39:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-23 10:39:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 10:39:50] [INFO ] Flow matrix only has 17 transitions (discarded 2 similar events)
[2023-03-23 10:39:50] [INFO ] Invariant cache hit.
[2023-03-23 10:39:51] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 19/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 14/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 123 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s8 1)), p0:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-12 finished in 260 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||G(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 10:39:51] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-23 10:39:51] [INFO ] Implicit Places using invariants in 37 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GEQ s0 1), p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-05120-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-05120-LTLFireability-14 finished in 519 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 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 10:39:51] [INFO ] Invariant cache hit.
[2023-03-23 10:39:51] [INFO ] Implicit Places using invariants in 32 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLFireability-15 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 (GEQ s4 1) (OR (AND (GEQ s2 1) (GEQ s15 1)) (AND (GEQ s8 1) (GEQ s10 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 MAPK-PT-05120-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLFireability-15 finished in 140 ms.
All properties solved by simple procedures.
Total runtime 6264 ms.
ITS solved all properties within timeout

BK_STOP 1679567992812

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="MAPK-PT-05120"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MAPK-PT-05120, 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 r233-tall-167856419100620"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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