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.r265-smll-167863540100468.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 PermAdmissibility-COL-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540100468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.8K Feb 26 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 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 PermAdmissibility-COL-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679029898607

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=PermAdmissibility-COL-02
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 05:11:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 05:11:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:11:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 05:11:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 05:11:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 775 ms
[2023-03-17 05:11:42] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-02-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 05:11:42] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-17 05:11:42] [INFO ] Skeletonized 15 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-02-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 8868 steps, including 183 resets, run visited all 20 properties in 99 ms. (steps per millisecond=89 )
[2023-03-17 05:11:42] [INFO ] Flatten gal took : 31 ms
[2023-03-17 05:11:42] [INFO ] Flatten gal took : 10 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-17 05:11:42] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 12 ms.
[2023-03-17 05:11:42] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 31 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 11 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2023-03-17 05:11:42] [INFO ] Computed 16 place invariants in 8 ms
[2023-03-17 05:11:42] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-17 05:11:42] [INFO ] Invariant cache hit.
[2023-03-17 05:11:43] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-17 05:11:43] [INFO ] Invariant cache hit.
[2023-03-17 05:11:43] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 32/40 places, 16/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 31 out of 32 places after structural reductions.
[2023-03-17 05:11:43] [INFO ] Flatten gal took : 5 ms
[2023-03-17 05:11:43] [INFO ] Flatten gal took : 6 ms
[2023-03-17 05:11:43] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 3046 steps, including 63 resets, run visited all 19 properties in 49 ms. (steps per millisecond=62 )
Computed a total of 32 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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&&X(X(p1))))))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-17 05:11:43] [INFO ] Computed 14 place invariants in 3 ms
[2023-03-17 05:11:43] [INFO ] Implicit Places using invariants in 100 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 20, 24, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 103 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s4 1) (LT s5 1)), p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 117 steps with 3 reset in 4 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-00 finished in 582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 4 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 5 ms. Remains 4 /32 variables (removed 28) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 4 cols
[2023-03-17 05:11:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:11:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 05:11:44] [INFO ] Invariant cache hit.
[2023-03-17 05:11:44] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 05:11:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 05:11:44] [INFO ] Invariant cache hit.
[2023-03-17 05:11:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-01 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:(OR (LT s0 1) (LT s1 1) (LT s2 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]]
Product exploration explored 100000 steps with 22195 reset in 362 ms.
Product exploration explored 100000 steps with 22241 reset in 194 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-01 finished in 900 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)&&F(G(p1))))||G(p0)))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-17 05:11:45] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-17 05:11:45] [INFO ] Implicit Places using invariants in 132 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 20, 25]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 133 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 19 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 16 transition count 12
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 16 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 12 transition count 8
Applied a total of 14 rules in 7 ms. Remains 12 /20 variables (removed 8) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-17 05:11:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:11:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 05:11:45] [INFO ] Invariant cache hit.
[2023-03-17 05:11:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/32 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 12/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s9 1)), p1:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 27 steps with 2 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-04 finished in 384 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&&X(X(p1))))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2023-03-17 05:11:45] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 05:11:45] [INFO ] Implicit Places using invariants in 73 ms returned [3, 5, 6, 7, 13, 14, 20, 21, 25, 26, 27]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 75 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 76 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1) (LT s9 1)), p1:(OR (LT s10 1) (LT s11 1) (LT s13 1) (LT s5 1) (LT s7 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24776 reset in 129 ms.
Product exploration explored 100000 steps with 24837 reset in 128 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-05 finished in 844 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((((p2&&X((F(p3)||G(p4))))||p1)&&p0))))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
[2023-03-17 05:11:46] [INFO ] Invariant cache hit.
[2023-03-17 05:11:46] [INFO ] Implicit Places using invariants in 76 ms returned [3, 5, 6, 7, 13, 14, 20, 21, 25, 26, 27]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 77 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s13 1)), p1:(OR (LT s10 1) (LT s11 1) (LT s13 1)), p2:(GEQ s11 1), p3:(OR (LT s7 1) (LT s8 1) (LT s9 1)), p4:(AND (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28587 reset in 95 ms.
Product exploration explored 100000 steps with 28599 reset in 101 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3 (NOT p4)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 12 factoid took 644 ms. Reduced automaton from 4 states, 8 edges and 5 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3 (NOT p4)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 12 factoid took 537 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 16 rows 20 cols
[2023-03-17 05:11:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:11:48] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 05:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:48] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-17 05:11:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:11:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 05:11:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-17 05:11:48] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-17 05:11:48] [INFO ] Added : 15 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-17 05:11:48] [INFO ] Invariant cache hit.
[2023-03-17 05:11:48] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 05:11:48] [INFO ] Invariant cache hit.
[2023-03-17 05:11:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-17 05:11:48] [INFO ] Invariant cache hit.
[2023-03-17 05:11:48] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 20/20 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-17 05:11:49] [INFO ] Invariant cache hit.
[2023-03-17 05:11:49] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 05:11:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:49] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-17 05:11:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:11:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 05:11:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:49] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 05:11:49] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-17 05:11:49] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 84 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 28574 reset in 106 ms.
Product exploration explored 100000 steps with 28563 reset in 97 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 27 edges and 20 vertex of which 6 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions removed 12 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 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 6 /20 variables (removed 14) and now considering 4/16 (removed 12) transitions.
[2023-03-17 05:11:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2023-03-17 05:11:50] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:11:50] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 6/20 places, 4/16 transitions.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 20 cols
[2023-03-17 05:11:50] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants in 34 ms returned [7, 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 : 18/20 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 18/20 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-02-LTLFireability-06 finished in 3931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)&&(G(p1)||F(p2))))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-17 05:11:50] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants in 62 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 20, 25]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 64 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p2:(AND (GEQ s15 1) (GEQ s16 1) (GEQ s19 1)), p0:(OR (LT s2 1) (LT s4 1) (LT 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-07 finished in 262 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(((!p1 U (p2||G(!p1)))&&p0))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2023-03-17 05:11:50] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants in 55 ms returned [7, 11, 14, 15, 16, 21]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 57 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 19 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 11
Applied a total of 4 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 17 cols
[2023-03-17 05:11:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 05:11:50] [INFO ] Invariant cache hit.
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 128 ms. Remains : 17/32 places, 11/16 transitions.
Stuttering acceptance computed with spot in 45 ms :[(OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p0:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s8 1) (OR (LT s12 1) (LT s13 1) (LT s16 1))), p1:(AND (GEQ s12 1) (GEQ s13 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 22 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-08 finished in 188 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((G(!p1)&&p0)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-17 05:11:50] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants in 60 ms returned [3, 5, 11, 13, 14, 15, 18, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 63 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 1) (GEQ s12 1) (GEQ s17 1) (GEQ s20 1) (OR (LT s15 1) (LT s16 1) (LT s18 1))), p1:(OR (LT s2 1) (LT s4 1) (LT s5 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]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-09 finished in 236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U (G(!p0)||p1))) U (G(X((!p0 U (p1||G(!p0)))))||(G(!p2)&&X((!p0 U (p1||G(!p0))))))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2023-03-17 05:11:50] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 05:11:50] [INFO ] Implicit Places using invariants in 52 ms returned [11, 13, 14, 15, 20, 21, 25, 26, 27]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 54 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND p0 (NOT p1)), p2, (AND p2 p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)), p0:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s7 1)), p1:(AND (NOT (AND (GEQ s2 1) (GEQ s6 1) (GEQ s7 1))) (NOT (AND (GEQ ...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-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(p0))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2023-03-17 05:11:51] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 05:11:51] [INFO ] Implicit Places using invariants in 34 ms returned [3, 7, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-17 05:11:51] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:11:51] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 05:11:51] [INFO ] Invariant cache hit.
[2023-03-17 05:11:51] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/32 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 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]]
Product exploration explored 100000 steps with 19534 reset in 68 ms.
Product exploration explored 100000 steps with 19519 reset in 78 ms.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-17 05:11:51] [INFO ] Invariant cache hit.
[2023-03-17 05:11:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-17 05:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:51] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-17 05:11:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:11:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 05:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-17 05:11:52] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:11:52] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-17 05:11:52] [INFO ] Invariant cache hit.
[2023-03-17 05:11:52] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 05:11:52] [INFO ] Invariant cache hit.
[2023-03-17 05:11:52] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-17 05:11:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 05:11:52] [INFO ] Invariant cache hit.
[2023-03-17 05:11:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 313 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-17 05:11:52] [INFO ] Invariant cache hit.
[2023-03-17 05:11:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-17 05:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-17 05:11:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:11:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-17 05:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:52] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-17 05:11:52] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:11:52] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19512 reset in 67 ms.
Product exploration explored 100000 steps with 19529 reset in 179 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-17 05:11:53] [INFO ] Invariant cache hit.
[2023-03-17 05:11:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 05:11:53] [INFO ] Invariant cache hit.
[2023-03-17 05:11:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-17 05:11:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 05:11:53] [INFO ] Invariant cache hit.
[2023-03-17 05:11:53] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property PermAdmissibility-COL-02-LTLFireability-13 finished in 1975 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)||G(p1)) U p2))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2023-03-17 05:11:53] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:11:53] [INFO ] Implicit Places using invariants in 54 ms returned [11, 13, 14, 15, 18, 19, 24, 26]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 57 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 12
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 18 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 18 transition count 10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 16 transition count 10
Applied a total of 10 rules in 2 ms. Remains 16 /22 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 16 cols
[2023-03-17 05:11:53] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 05:11:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 05:11:53] [INFO ] Invariant cache hit.
[2023-03-17 05:11:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 134 ms. Remains : 16/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s12 1) (GEQ s13 1)), p0:(OR (LT s2 1) (LT s6 1) (LT s7 1)), p1:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-15 finished in 311 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((((p2&&X((F(p3)||G(p4))))||p1)&&p0))))'
Found a Shortening insensitive property : PermAdmissibility-COL-02-LTLFireability-06
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p3)))]
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 1 ms. Remains 11 /32 variables (removed 21) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 11 cols
[2023-03-17 05:11:53] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-17 05:11:53] [INFO ] Implicit Places using invariants in 26 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/32 places, 6/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 29 ms. Remains : 10/32 places, 6/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3) (NOT p4)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s7 1)), p1:(OR (LT s4 1) (LT s5 1) (LT s7 1)), p2:(GEQ s5 1), p3:(OR (LT s1 1) (LT s2 1) (LT s3 1)), p4:(AND (GEQ s4 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 28568 reset in 145 ms.
Product exploration explored 100000 steps with 28584 reset in 324 ms.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3 (NOT p4)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 12 factoid took 531 ms. Reduced automaton from 4 states, 8 edges and 5 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2) p3 (NOT p4)), (X (OR (NOT p0) (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3) (NOT p4))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) p4) (AND (NOT p1) (NOT p3) p4))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (G (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G p3)), (F (G (NOT p4)))]
False Knowledge obtained : [(X (X (OR (NOT p0) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND (NOT p1) (NOT p2)))))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 12 factoid took 513 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 6 rows 10 cols
[2023-03-17 05:11:55] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:11:55] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 05:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:55] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-17 05:11:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:11:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 05:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-17 05:11:55] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:11:55] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 10 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-17 05:11:55] [INFO ] Invariant cache hit.
[2023-03-17 05:11:55] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 05:11:55] [INFO ] Invariant cache hit.
[2023-03-17 05:11:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-17 05:11:55] [INFO ] Invariant cache hit.
[2023-03-17 05:11:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 10/10 places, 6/6 transitions.
Computed a total of 10 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 6
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0)))))]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (OR (AND (NOT p1) (NOT p2)) (NOT p0))), (F (G p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p0))))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 2 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-17 05:11:56] [INFO ] Invariant cache hit.
[2023-03-17 05:11:56] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-17 05:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:56] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-17 05:11:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:11:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-17 05:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:11:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-17 05:11:56] [INFO ] Computed and/alt/rep : 5/9/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:11:56] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 28549 reset in 83 ms.
Product exploration explored 100000 steps with 28577 reset in 97 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Graph (complete) has 15 edges and 10 vertex of which 6 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop 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 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 2 ms. Remains 6 /10 variables (removed 4) and now considering 4/6 (removed 2) transitions.
[2023-03-17 05:11:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2023-03-17 05:11:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-17 05:11:57] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/10 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 6/10 places, 4/6 transitions.
Support contains 4 out of 10 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10/10 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 10 cols
[2023-03-17 05:11:57] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:11:57] [INFO ] Implicit Places using invariants in 24 ms returned [1, 3]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8/10 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 26 ms. Remains : 8/10 places, 6/6 transitions.
Treatment of property PermAdmissibility-COL-02-LTLFireability-06 finished in 3659 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))'
[2023-03-17 05:11:57] [INFO ] Flatten gal took : 4 ms
[2023-03-17 05:11:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-17 05:11:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 16 transitions and 75 arcs took 0 ms.
Total runtime 16121 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1406/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1406/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PermAdmissibility-COL-02-LTLFireability-06
Could not compute solution for formula : PermAdmissibility-COL-02-LTLFireability-13

BK_STOP 1679029919086

--------------------
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
mcc2023
ltl formula name PermAdmissibility-COL-02-LTLFireability-06
ltl formula formula --ltl=/tmp/1406/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1406/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name PermAdmissibility-COL-02-LTLFireability-13
ltl formula formula --ltl=/tmp/1406/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 32 places, 16 transitions and 75 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1406/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1406/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1406/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1406/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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="PermAdmissibility-COL-02"
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 PermAdmissibility-COL-02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540100468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;