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-167856419100612.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-02560, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856419100612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 9.7K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 10:51 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 3.7K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-02560-LTLFireability-00
FORMULA_NAME MAPK-PT-02560-LTLFireability-01
FORMULA_NAME MAPK-PT-02560-LTLFireability-02
FORMULA_NAME MAPK-PT-02560-LTLFireability-03
FORMULA_NAME MAPK-PT-02560-LTLFireability-04
FORMULA_NAME MAPK-PT-02560-LTLFireability-05
FORMULA_NAME MAPK-PT-02560-LTLFireability-06
FORMULA_NAME MAPK-PT-02560-LTLFireability-07
FORMULA_NAME MAPK-PT-02560-LTLFireability-08
FORMULA_NAME MAPK-PT-02560-LTLFireability-09
FORMULA_NAME MAPK-PT-02560-LTLFireability-10
FORMULA_NAME MAPK-PT-02560-LTLFireability-11
FORMULA_NAME MAPK-PT-02560-LTLFireability-12
FORMULA_NAME MAPK-PT-02560-LTLFireability-13
FORMULA_NAME MAPK-PT-02560-LTLFireability-14
FORMULA_NAME MAPK-PT-02560-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679564932480

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-02560
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 09:48:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 09:48:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 09:48:54] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-23 09:48:54] [INFO ] Transformed 22 places.
[2023-03-23 09:48:54] [INFO ] Transformed 30 transitions.
[2023-03-23 09:48:54] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 18 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 20 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 09:48:54] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-23 09:48:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-23 09:48:54] [INFO ] Invariant cache hit.
[2023-03-23 09:48:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-23 09:48:54] [INFO ] Invariant cache hit.
[2023-03-23 09:48:54] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 18 out of 22 places after structural reductions.
[2023-03-23 09:48:54] [INFO ] Flatten gal took : 18 ms
[2023-03-23 09:48:54] [INFO ] Flatten gal took : 5 ms
[2023-03-23 09:48:54] [INFO ] Input system was already deterministic with 30 transitions.
Support contains 17 out of 22 places (down from 18) after GAL structural reductions.
Incomplete random walk after 10258 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=394 ) properties (out of 20) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-23 09:48:55] [INFO ] Invariant cache hit.
[2023-03-23 09:48:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-23 09:48:55] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-23 09:48:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-23 09:48:55] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-23 09:48:55] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-23 09:48:55] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 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 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
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 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 18 place count 12 transition count 22
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 4 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 25 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 10 vertex of which 3 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 8 transition count 14
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 33 place count 8 transition count 10
Applied a total of 33 rules in 17 ms. Remains 8 /22 variables (removed 14) and now considering 10/30 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 8/22 places, 10/30 transitions.
Incomplete random walk after 10888 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=573 ) properties (out of 3) seen :1
Finished Best-First random walk after 139 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=69 )
FORMULA MAPK-PT-02560-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((p0||X(X(X(X(G((p1||F(p2))))))))))'
Support contains 4 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 09:48:55] [INFO ] Invariant cache hit.
[2023-03-23 09:48:55] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 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 35 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(GEQ s15 1), p2:(GEQ s10 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2164 reset in 225 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 15 in 0 ms.
FORMULA MAPK-PT-02560-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-02560-LTLFireability-00 finished in 710 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||G(F(p1))))))'
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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 12 transition count 22
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 12 transition count 17
Applied a total of 23 rules in 7 ms. Remains 12 /22 variables (removed 10) and now considering 17/30 (removed 13) transitions.
[2023-03-23 09:48:56] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-23 09:48:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-23 09:48:56] [INFO ] Implicit Places using invariants in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 17/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35 ms. Remains : 11/22 places, 17/30 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s8 1), p1:(LT s1 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 221 steps with 0 reset in 3 ms.
FORMULA MAPK-PT-02560-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-01 finished in 142 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((((!p1 U (p2||G(!p1)))&&F((!p1 U (p3||G(!p1)))))||p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
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 0 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 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 17 transition count 23
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 17 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 16 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 16 transition count 22
Applied a total of 16 rules in 5 ms. Remains 16 /22 variables (removed 6) and now considering 22/30 (removed 8) transitions.
[2023-03-23 09:48:56] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 16 cols
[2023-03-23 09:48:56] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 09:48:56] [INFO ] Implicit Places using invariants in 25 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 22/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 21
Applied a total of 1 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 21/22 (removed 1) transitions.
[2023-03-23 09:48:56] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-23 09:48:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 09:48:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-23 09:48:56] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2023-03-23 09:48:56] [INFO ] Invariant cache hit.
[2023-03-23 09:48:56] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-23 09:48:56] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/22 places, 21/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 15/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 (NOT p3))), true, (AND p0 (NOT p2) p1), (AND p1 (NOT p3))]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s6 1)), p2:(AND (LT s12 1) (LT s9 1)), p1:(GEQ s12 1), p3:(AND (LT s12 1) (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 4 ms.
FORMULA MAPK-PT-02560-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-02 finished in 290 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(G(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 0 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 09:48:56] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 09:48:56] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 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 32 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s7 1)), p1:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-03 finished in 174 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 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 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 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 15 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 15 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 15 transition count 22
Applied a total of 16 rules in 11 ms. Remains 15 /22 variables (removed 7) and now considering 22/30 (removed 8) transitions.
[2023-03-23 09:48:57] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 15 cols
[2023-03-23 09:48:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants in 23 ms returned [7]
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 : 14/22 places, 22/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 35 ms. Remains : 14/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-04 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:(AND (GEQ s7 1) (GEQ s9 1)), p0:(OR (GEQ s10 1) (NOT (AND (GEQ s6 1) (GEQ s12 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 MAPK-PT-02560-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-04 finished in 125 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(X(!(F(((p0 U p1)&&!p0)) U p2)))))'
Support contains 4 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 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 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 15 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 15 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 15 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 15 transition count 21
Applied a total of 19 rules in 9 ms. Remains 15 /22 variables (removed 7) and now considering 21/30 (removed 9) transitions.
[2023-03-23 09:48:57] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-23 09:48:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants in 40 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 21/30 transitions.
Applied a total of 0 rules in 6 ms. Remains 13 /13 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56 ms. Remains : 13/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[p2, p2, (AND (NOT p0) p1 p2)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p1) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p2) (AND (NOT p1) p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(LT s0 1), p1:(AND (GEQ s6 1) (GEQ s11 1)), p2:(GEQ s3 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 56 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-06 finished in 220 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 1 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 4 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 09:48:57] [INFO ] Computed 7 place invariants in 12 ms
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants in 74 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 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 81 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, p0, p0]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s15 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-02560-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-07 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&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 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 14 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 14 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 14 transition count 21
Applied a total of 18 rules in 5 ms. Remains 14 /22 variables (removed 8) and now considering 21/30 (removed 9) transitions.
[2023-03-23 09:48:57] [INFO ] Flow matrix only has 16 transitions (discarded 5 similar events)
// Phase 1: matrix 16 rows 14 cols
[2023-03-23 09:48:57] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants in 27 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 21/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 13 transition count 20
Applied a total of 1 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 20/21 (removed 1) transitions.
[2023-03-23 09:48:57] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
// Phase 1: matrix 16 rows 13 cols
[2023-03-23 09:48:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-23 09:48:57] [INFO ] Flow matrix only has 16 transitions (discarded 4 similar events)
[2023-03-23 09:48:57] [INFO ] Invariant cache hit.
[2023-03-23 09:48:57] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/22 places, 20/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 104 ms. Remains : 13/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 122 ms :[p1, (NOT p1), true, true]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(GEQ s6 1), p0:(AND (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-08 finished in 244 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||G(!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.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 09:48:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 09:48:57] [INFO ] Implicit Places using invariants in 30 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 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 33 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (LT s11 1) (GEQ s7 1) (GEQ s8 1)), p0:(GEQ s11 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-09 finished in 131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(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.
[2023-03-23 09:48:57] [INFO ] Invariant cache hit.
[2023-03-23 09:48:58] [INFO ] Implicit Places using invariants in 35 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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 37 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s4 1), p0:(GEQ s1 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 372 reset in 185 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA MAPK-PT-02560-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-02560-LTLFireability-10 finished in 358 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(!p1)&&p0)) U X(!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 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 09:48:58] [INFO ] Invariant cache hit.
[2023-03-23 09:48:58] [INFO ] Implicit Places using invariants in 33 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 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 37 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 187 ms :[p2, p2, p2, true, (OR (NOT p0) p1)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p2 p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s8 1)), p2:(GEQ s4 1), p1:(AND (GEQ s19 1) (GEQ s20 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 95 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 p0) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p2 p1))))), (X (X (OR (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 9 factoid took 133 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-02560-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-02560-LTLFireability-11 finished in 561 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(F(!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 09:48:58] [INFO ] Invariant cache hit.
[2023-03-23 09:48:58] [INFO ] Implicit Places using invariants in 26 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 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 30 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1)), p1:(LT 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 4449 reset in 98 ms.
Stack based approach found an accepted trace after 11 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA MAPK-PT-02560-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-02560-LTLFireability-12 finished in 291 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(F(G((F(G(p0))&&X(!(X(F(!p0)) U !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 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 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 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Graph (trivial) has 4 edges and 16 vertex of which 2 / 16 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 11 place count 15 transition count 26
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 14 place count 15 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 15 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 14 transition count 21
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 14 transition count 21
Applied a total of 20 rules in 9 ms. Remains 14 /22 variables (removed 8) and now considering 21/30 (removed 9) transitions.
[2023-03-23 09:48:59] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2023-03-23 09:48:59] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-23 09:48:59] [INFO ] Implicit Places using invariants in 31 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 21/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 43 ms. Remains : 12/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1, 2} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={2} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=0 dest: 2}], [{ cond=p0, acceptance={1, 2} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={2} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={2} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 2} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s5 1)), p0:(LT s8 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-13 finished in 243 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 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 10 transition count 21
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 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 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 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 8 transition count 10
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 1 with 2 rules applied. Total rules applied 36 place count 7 transition count 9
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 1 with 2 rules applied. Total rules applied 38 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 6 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 4 transition count 5
Applied a total of 43 rules in 34 ms. Remains 4 /22 variables (removed 18) and now considering 5/30 (removed 25) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-23 09:48:59] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-23 09:48:59] [INFO ] Implicit Places using invariants in 20 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/22 places, 5/30 transitions.
Graph (trivial) has 2 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-23 09:48:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-23 09:48:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-23 09:48:59] [INFO ] Invariant cache hit.
[2023-03-23 09:48:59] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/22 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 95 ms. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 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-02560-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-14 finished in 145 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&&X(p0)&&F(!p2))||X(G(p0)))))'
Support contains 4 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 09:48:59] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-23 09:48:59] [INFO ] Implicit Places using invariants in 31 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 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 34 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p2), true, (AND p2 (NOT p0)), p2]
Running random walk in product with property : MAPK-PT-02560-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p0:(GEQ s16 1), p1:(LT s5 1), p2:(AND (GEQ s6 1) (GEQ s7 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-LTLFireability-15 finished in 254 ms.
All properties solved by simple procedures.
Total runtime 5597 ms.
ITS solved all properties within timeout

BK_STOP 1679564940883

--------------------
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

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-02560"
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-02560, 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-167856419100612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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