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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:46 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.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:21 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-00008-LTLFireability-00
FORMULA_NAME MAPK-PT-00008-LTLFireability-01
FORMULA_NAME MAPK-PT-00008-LTLFireability-02
FORMULA_NAME MAPK-PT-00008-LTLFireability-03
FORMULA_NAME MAPK-PT-00008-LTLFireability-04
FORMULA_NAME MAPK-PT-00008-LTLFireability-05
FORMULA_NAME MAPK-PT-00008-LTLFireability-06
FORMULA_NAME MAPK-PT-00008-LTLFireability-07
FORMULA_NAME MAPK-PT-00008-LTLFireability-08
FORMULA_NAME MAPK-PT-00008-LTLFireability-09
FORMULA_NAME MAPK-PT-00008-LTLFireability-10
FORMULA_NAME MAPK-PT-00008-LTLFireability-11
FORMULA_NAME MAPK-PT-00008-LTLFireability-12
FORMULA_NAME MAPK-PT-00008-LTLFireability-13
FORMULA_NAME MAPK-PT-00008-LTLFireability-14
FORMULA_NAME MAPK-PT-00008-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679553213009

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-00008
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 06:33:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:33:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:33:34] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-23 06:33:34] [INFO ] Transformed 22 places.
[2023-03-23 06:33:34] [INFO ] Transformed 30 transitions.
[2023-03-23 06:33:34] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 84 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 3 formulas.
FORMULA MAPK-PT-00008-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00008-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 8 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 06:33:34] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-23 06:33:35] [INFO ] Implicit Places using invariants in 325 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 348 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 359 ms. Remains : 21/22 places, 30/30 transitions.
Support contains 18 out of 21 places after structural reductions.
[2023-03-23 06:33:35] [INFO ] Flatten gal took : 16 ms
[2023-03-23 06:33:35] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:33:35] [INFO ] Input system was already deterministic with 30 transitions.
Support contains 17 out of 21 places (down from 18) after GAL structural reductions.
Finished random walk after 1821 steps, including 0 resets, run visited all 18 properties in 97 ms. (steps per millisecond=18 )
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)||G((p1 U (p2 U X(p0))))))'
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
// Phase 1: matrix 30 rows 21 cols
[2023-03-23 06:33:35] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 06:33:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-23 06:33:35] [INFO ] Invariant cache hit.
[2023-03-23 06:33:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-23 06:33:35] [INFO ] Invariant cache hit.
[2023-03-23 06:33:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 412 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(OR p2 p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=true, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (LT s18 1) (GEQ s12 1)), p1:(GEQ s4 1), p0:(AND (GEQ s6 1) (GEQ s8 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-00008-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-00 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p0)||(!p1&&G(!p2))))))))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-23 06:33:36] [INFO ] Invariant cache hit.
[2023-03-23 06:33:36] [INFO ] Implicit Places using invariants in 41 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/21 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/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 364 ms :[true, (NOT p0), (NOT p0), p2, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-02 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: 4}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GEQ s0 1), p2:(OR (AND (GEQ s7 1) (GEQ s13 1)) (GEQ s4 1)), p1:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][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-00008-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-02 finished in 425 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(p0)&&(p1 U (G(p1)||(p1&&(X(p2) U ((G(p1)&&X(p2))||X(G(p2))))))))))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-23 06:33:36] [INFO ] Invariant cache hit.
[2023-03-23 06:33:36] [INFO ] Implicit Places using invariants in 35 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/21 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 39 ms. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=1, aps=[p1:(GEQ s16 1), p2:(LT s10 1), p0:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, 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-00008-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-03 finished in 408 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((G(!p1) U (p0&&G(!p1))))))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 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 21 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 19 transition count 29
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 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 10 transition count 22
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 2 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 21 place count 8 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 24 place count 8 transition count 19
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 32 place count 8 transition count 11
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 34 place count 7 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 6 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 6 transition count 8
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 40 place count 4 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 4 transition count 6
Applied a total of 41 rules in 15 ms. Remains 4 /21 variables (removed 17) and now considering 6/30 (removed 24) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-23 06:33:37] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-23 06:33:37] [INFO ] Invariant cache hit.
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-23 06:33:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 06:33:37] [INFO ] Invariant cache hit.
[2023-03-23 06:33:37] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/21 places, 6/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 4/21 places, 6/30 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=p1, acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(LT 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 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00008-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-04 finished in 239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(p0)&&G(p1)))&&F(p2)))'
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
// Phase 1: matrix 30 rows 21 cols
[2023-03-23 06:33:37] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants in 41 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 : 20/21 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/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s15 1), p0:(GEQ s0 1), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA MAPK-PT-00008-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-06 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 3 edges and 21 vertex of which 2 / 21 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.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 20 transition count 28
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 4 place count 18 transition count 28
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 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 20 place count 9 transition count 21
Graph (trivial) has 10 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
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 7 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 10 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 6 transition count 18
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 6 transition count 15
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 2 with 7 rules applied. Total rules applied 36 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 5 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 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 4 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 4 transition count 5
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 2 with 3 rules applied. Total rules applied 44 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 2 transition count 3
Applied a total of 45 rules in 9 ms. Remains 2 /21 variables (removed 19) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-23 06:33:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-23 06:33:37] [INFO ] Invariant cache hit.
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-23 06:33:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 06:33:37] [INFO ] Invariant cache hit.
[2023-03-23 06:33:37] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 2/21 places, 3/30 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-07 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:(GEQ s0 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 0 ms.
FORMULA MAPK-PT-00008-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-07 finished in 179 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))&&(!p1 U (p2||G(!p1)))))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2023-03-23 06:33:37] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-23 06:33:37] [INFO ] Invariant cache hit.
[2023-03-23 06:33:37] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-23 06:33:37] [INFO ] Invariant cache hit.
[2023-03-23 06:33:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s6 1) (GEQ s8 1))) (LT s1 1)), p1:(AND (GEQ s6 1) (GEQ s8 1)), p0:(OR (LT s8 1) (LT 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 123 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 p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 192 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-00008-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-00008-LTLFireability-08 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 27
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 4 place count 17 transition count 27
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 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 17 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 19 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 8 vertex of which 3 / 8 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 24 place count 6 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 32 place count 5 transition count 10
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 4 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 4 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 39 place count 4 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 2 transition count 3
Applied a total of 42 rules in 8 ms. Remains 2 /21 variables (removed 19) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-23 06:33:38] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-23 06:33:38] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-23 06:33:38] [INFO ] Invariant cache hit.
[2023-03-23 06:33:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-23 06:33:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-23 06:33:38] [INFO ] Invariant cache hit.
[2023-03-23 06:33:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 2/21 places, 3/30 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00008-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00008-LTLFireability-09 finished in 156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U p1)))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
// Phase 1: matrix 30 rows 21 cols
[2023-03-23 06:33:38] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-23 06:33:38] [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 : 20/21 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 36 ms. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1) (GEQ s15 1)), p0:(LT s10 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2449 reset in 213 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA MAPK-PT-00008-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00008-LTLFireability-11 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U X((p1||X(F(!p2)))))))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-23 06:33:39] [INFO ] Invariant cache hit.
[2023-03-23 06:33:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-23 06:33:39] [INFO ] Invariant cache hit.
[2023-03-23 06:33:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-23 06:33:39] [INFO ] Invariant cache hit.
[2023-03-23 06:33:39] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), (AND (NOT p1) p2), (AND p0 (NOT p1) p2), (AND p0 p2)]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s12 1), p1:(GEQ s1 1), p2:(OR (LT s8 1) (LT s10 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2499 reset in 226 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 1 ms.
FORMULA MAPK-PT-00008-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00008-LTLFireability-12 finished in 621 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||F(G(p1)))))'
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-23 06:33:39] [INFO ] Invariant cache hit.
[2023-03-23 06:33:39] [INFO ] Implicit Places using invariants in 31 ms returned [8]
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 : 20/21 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 33 ms. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s0 1), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-00008-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00008-LTLFireability-13 finished in 289 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&&(!p1||X(p2)))) U p0))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-23 06:33:40] [INFO ] Invariant cache hit.
[2023-03-23 06:33:40] [INFO ] Implicit Places using invariants in 35 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/21 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/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR p0 (AND p1 (NOT p2)))]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s13 1)), p1:(AND (GEQ s15 1) (GEQ s10 1)), p2:(LT s10 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1962 reset in 133 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-00008-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00008-LTLFireability-14 finished in 313 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(((G(!p1) U p2)&&p0)) U !p3)))'
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-23 06:33:40] [INFO ] Invariant cache hit.
[2023-03-23 06:33:40] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-23 06:33:40] [INFO ] Invariant cache hit.
[2023-03-23 06:33:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-23 06:33:40] [INFO ] Invariant cache hit.
[2023-03-23 06:33:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 242 ms :[p3, p3, true, p1, (NOT p2), (OR (NOT p2) (NOT p0))]
Running random walk in product with property : MAPK-PT-00008-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 p0 p2) (AND p3 p0 (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND p3 (NOT p2) p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p3 p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 4}, { cond=(OR (AND p3 p0 p2) (AND p3 p0 (NOT p1))), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(GEQ s1 1), p0:(AND (GEQ s6 1) (GEQ s8 1)), p2:(AND (GEQ s6 1) (GEQ s8 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Product exploration explored 100000 steps with 50000 reset in 81 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 p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT (OR (AND p3 p0 p2) (AND p3 p0 (NOT p1))))), (X (NOT (OR (AND p3 (NOT p0)) (AND p3 (NOT p2) p1)))), (X (NOT (AND p3 p0 (NOT p2) (NOT p1)))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR (AND p3 p0 p2) (AND p3 p0 (NOT p1)))))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p3 (NOT p2) p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND p0 p2) (AND p0 (NOT p1)))))), (X (X (NOT (AND p3 p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (X (X (OR (NOT p0) (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (OR (AND p3 (NOT p0)) (AND p3 (NOT p2) p1))))
Knowledge based reduction with 14 factoid took 220 ms. Reduced automaton from 6 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-00008-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-00008-LTLFireability-15 finished in 741 ms.
All properties solved by simple procedures.
Total runtime 6593 ms.
ITS solved all properties within timeout

BK_STOP 1679553222069

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

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