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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 01:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 01:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:19 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.6K 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.5K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 01:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 01:27 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-01-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679029721348

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-01
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 05:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 05:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 05:08:44] [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:08:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 05:08:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 888 ms
[2023-03-17 05:08:45] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 05:08:45] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2023-03-17 05:08:45] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-01-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLFireability-13 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 14 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).
Incomplete random walk after 10000 steps, including 588 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-17 05:08:45] [INFO ] Computed 24 place invariants in 11 ms
[2023-03-17 05:08:45] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-17 05:08:45] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-17 05:08:45] [INFO ] Flatten gal took : 29 ms
[2023-03-17 05:08:46] [INFO ] Flatten gal took : 8 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:08:46] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 17 ms.
[2023-03-17 05:08:46] [INFO ] Unfolded 14 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 9 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:08:46] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-17 05:08:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-17 05:08:46] [INFO ] Invariant cache hit.
[2023-03-17 05:08:46] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-17 05:08:46] [INFO ] Invariant cache hit.
[2023-03-17 05:08:46] [INFO ] Dead Transitions using invariants and state equation in 47 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 195 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 31 out of 32 places after structural reductions.
[2023-03-17 05:08:46] [INFO ] Flatten gal took : 6 ms
[2023-03-17 05:08:46] [INFO ] Flatten gal took : 6 ms
[2023-03-17 05:08:46] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10000 steps, including 588 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 05:08:46] [INFO ] Invariant cache hit.
[2023-03-17 05:08:46] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 13 ms returned sat
[2023-03-17 05:08:46] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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' '!(F((!p0||X(p0))))'
Support contains 0 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 6 ms. Remains 10 /32 variables (removed 22) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2023-03-17 05:08:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants in 41 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/32 places, 6/16 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 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Applied a total of 2 rules in 4 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-17 05:08:47] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 05:08:47] [INFO ] Invariant cache hit.
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 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 109 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 39 ms :[false]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-00 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-00 TRUE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-00 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
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.
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 4 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:08:47] [INFO ] Computed 12 place invariants in 2 ms
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants in 59 ms returned [4, 5, 6, 7, 12, 13, 16, 18]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 61 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 12
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 16 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 13 transition count 9
Applied a total of 8 rules in 9 ms. Remains 13 /18 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-17 05:08:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-17 05:08:47] [INFO ] Invariant cache hit.
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/32 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 13/32 places, 9/16 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ 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}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1) (GEQ s8 1)), p1:(OR (LT s9 1) (LT s10 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 4 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-01 finished in 461 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 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 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:08:47] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants in 80 ms returned [4, 6, 12, 13, 14, 15, 22, 23, 25, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 81 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 1 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 84 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s14 1)), p1:(OR (LT s0 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-02 finished in 312 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 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 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2023-03-17 05:08:47] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 05:08:47] [INFO ] Implicit Places using invariants in 35 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/32 places, 4/16 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 3/4 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 39 ms. Remains : 5/32 places, 3/16 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25000 reset in 251 ms.
Product exploration explored 100000 steps with 25000 reset in 212 ms.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
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)), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-03 finished in 709 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(p1)&&(!p1 U !p2)&&X(p3)&&p0)))'
Support contains 12 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:08:48] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-17 05:08:48] [INFO ] Implicit Places using invariants in 53 ms returned [12, 15, 16, 17, 19, 24, 26]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 55 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p0) (NOT p1) (NOT p3) p2), (OR (NOT p0) (NOT p1) (NOT p3) p2), (OR (NOT p3) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p3), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s13 1)), p1:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s7 1)), p2:(AND (GEQ s18 1) (GEQ s20 1) (GEQ s23 1)), p3:(OR (LT s3 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-04 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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 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:08:48] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:08:48] [INFO ] Implicit Places using invariants in 72 ms returned [5, 7, 12, 13, 14, 15, 16, 18, 23, 25]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 74 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 77 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s16 1) (LT s17 1) (AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 168 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-05 finished in 622 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)||(p1 U G(!p2)))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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 3 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:08:49] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-17 05:08:49] [INFO ] Implicit Places using invariants in 65 ms returned [4, 6, 12, 13, 14, 15, 16, 18]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 68 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 14/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 17 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 14 transition count 10
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 14 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 12 transition count 8
Applied a total of 10 rules in 5 ms. Remains 12 /18 variables (removed 6) and now considering 8/14 (removed 6) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-17 05:08:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-17 05:08:49] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 05:08:49] [INFO ] Invariant cache hit.
[2023-03-17 05:08:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 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 130 ms. Remains : 12/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND p2 p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(OR (LT s0 1) (LT s4 1) (LT s5 1)), p0:(OR (LT s8 1) (LT s9 1) (LT s10 1))], nbAcceptance=2, 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 8 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-06 finished in 186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))&&F((!p1 U (p2||G(!p1)))))))'
Support contains 10 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:08:49] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-17 05:08:49] [INFO ] Implicit Places using invariants in 63 ms returned [4, 5, 6, 7, 12, 17, 19, 24, 26]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 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 0 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 67 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s15 1)), p2:(AND (GEQ s7 1) (GEQ s8 1) (GEQ s9 1) (NOT (OR (AND (GEQ s16 1) (GEQ s18 1) (GEQ s19 1)) (AND (GEQ s16 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 53 steps with 7 reset in 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-07 finished in 418 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 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:08:50] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:08:50] [INFO ] Implicit Places using invariants in 70 ms returned [4, 5, 6, 7, 12, 13, 16, 18, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 71 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 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 72 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-09 finished in 175 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.
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.
[2023-03-17 05:08:50] [INFO ] Invariant cache hit.
[2023-03-17 05:08:50] [INFO ] Implicit Places using invariants in 81 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18, 23, 25]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 82 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 17 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 10 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 14 place count 10 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 7 transition count 5
Applied a total of 20 rules in 2 ms. Remains 7 /18 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-17 05:08:50] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-17 05:08:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 05:08:50] [INFO ] Invariant cache hit.
[2023-03-17 05:08:50] [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.
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 135 ms. Remains : 7/32 places, 5/16 transitions.
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s6 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 18184 reset in 218 ms.
Product exploration explored 100000 steps with 18182 reset in 165 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 : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 111 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-01-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-10 finished in 750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U 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 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 9 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:08:51] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:08:51] [INFO ] Implicit Places using invariants in 74 ms returned [4, 5, 6, 7, 12, 13, 16, 18, 22, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 76 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 86 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (LT s14 1) (LT s15 1) (LT s16 1)), p1:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-11 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0&&G(!p1)) U p2) U !p3) U p2))'
Support contains 7 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.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 27 /32 variables (removed 5) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 27 cols
[2023-03-17 05:08:51] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-17 05:08:51] [INFO ] Implicit Places using invariants in 63 ms returned [4, 5, 6, 7, 14, 15, 16, 17, 19]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 79 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 14/16 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 18 transition count 9
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 13 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 12 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 12 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 11 transition count 7
Applied a total of 14 rules in 5 ms. Remains 11 /18 variables (removed 7) and now considering 7/14 (removed 7) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-17 05:08:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-17 05:08:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 05:08:51] [INFO ] Invariant cache hit.
[2023-03-17 05:08:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/32 places, 7/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 11/32 places, 7/16 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), true, p1, (NOT p2), p3]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) p0 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p2) p3 (NOT p0)) (AND (NOT p2) p3 p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p3 p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND p2 p3) (AND p3 p0 (NOT p1))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s9 1) (GEQ s10 1)), p3:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s6 1)), p0:(OR (AND (GEQ s7 1) (GEQ s9 1) (GEQ s10 1)) (AND (GEQ s3 1) (GEQ...], 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 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-12 finished in 359 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 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 3 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2023-03-17 05:08:51] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-17 05:08:51] [INFO ] Implicit Places using invariants in 26 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/32 places, 4/16 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /6 variables (removed 1) and now considering 3/4 (removed 1) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 5/32 places, 3/16 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s3 1) (LT s4 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 7 steps with 2 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-14 finished in 123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(F((X(F(!p3))&&p2))))))'
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:08:51] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-17 05:08:51] [INFO ] Implicit Places using invariants in 51 ms returned [5, 7, 12, 13, 16, 18, 22, 26]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 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 0 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 55 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) p3), p3, (AND (NOT p1) p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=p3, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s13 1)), p3:(OR (LT s16 1) (LT s17 1) (LT s18 1)), p1:(AND (GEQ s10 1) (GEQ s11 1) (GEQ s13 1)), p0:(AND (GEQ s2 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7692 reset in 81 ms.
Product exploration explored 100000 steps with 7692 reset in 118 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 p2) p3 (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X p3)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 718 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X p3)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p3)), (F p2)]
Knowledge based reduction with 18 factoid took 762 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Stuttering acceptance computed with spot in 125 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
// Phase 1: matrix 16 rows 22 cols
[2023-03-17 05:08:54] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 05:08:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 05:08:54] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-17 05:08:54] [INFO ] Added : 5 causal constraints over 1 iterations in 33 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-17 05:08:54] [INFO ] Invariant cache hit.
[2023-03-17 05:08:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:08:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:54] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 05:08:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:08:54] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:08:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 05:08:54] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:08:54] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG p3
Support contains 6 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 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.
[2023-03-17 05:08:54] [INFO ] Invariant cache hit.
[2023-03-17 05:08:54] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-17 05:08:54] [INFO ] Invariant cache hit.
[2023-03-17 05:08:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-17 05:08:54] [INFO ] Invariant cache hit.
[2023-03-17 05:08:54] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 22/22 places, 16/16 transitions.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 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 p3 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 250 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p3 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p3)), (F p2)]
Knowledge based reduction with 6 factoid took 386 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Stuttering acceptance computed with spot in 112 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
[2023-03-17 05:08:55] [INFO ] Invariant cache hit.
[2023-03-17 05:08:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-17 05:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 05:08:55] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:08:55] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-17 05:08:55] [INFO ] Invariant cache hit.
[2023-03-17 05:08:55] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-17 05:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:55] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-17 05:08:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:08:55] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:55] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-17 05:08:55] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-17 05:08:55] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 114 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Product exploration explored 100000 steps with 7692 reset in 145 ms.
Product exploration explored 100000 steps with 7692 reset in 197 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 37 edges and 22 vertex of which 20 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 20 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 20 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 5 rules in 9 ms. Remains 20 /22 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2023-03-17 05:08:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 20 cols
[2023-03-17 05:08:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 05:08:56] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/22 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 58 ms. Remains : 20/22 places, 14/16 transitions.
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 22 cols
[2023-03-17 05:08:56] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 05:08:56] [INFO ] Implicit Places using invariants in 30 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 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 32 ms. Remains : 20/22 places, 16/16 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-15 finished in 4900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(F((X(F(!p3))&&p2))))))'
Found a Shortening insensitive property : PermAdmissibility-COL-01-LTLFireability-15
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p2) p3), p3, (AND (NOT p1) p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3))]
Support contains 9 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 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 16 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:08:57] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-17 05:08:57] [INFO ] Implicit Places using invariants in 57 ms returned [5, 7, 12, 13, 16, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 60 ms to find 6 implicit places.
Starting structural reductions in LI_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 2 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:08:57] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 05:08:57] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-17 05:08:57] [INFO ] Invariant cache hit.
[2023-03-17 05:08:57] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 17/32 places, 11/16 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 138 ms. Remains : 17/32 places, 11/16 transitions.
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=p3, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s11 1)), p3:(OR (LT s13 1) (LT s14 1) (LT s15 1)), p1:(AND (GEQ s8 1) (GEQ s9 1) (GEQ s11 1)), p0:(AND (GEQ s2 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10000 reset in 116 ms.
Product exploration explored 100000 steps with 10000 reset in 114 ms.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
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 p2) p3 (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X p3)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 717 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p2) p3 (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X p3)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0) p3))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p3)), (F p2)]
Knowledge based reduction with 18 factoid took 729 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Stuttering acceptance computed with spot in 113 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
[2023-03-17 05:08:59] [INFO ] Invariant cache hit.
[2023-03-17 05:08:59] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 05:08:59] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 05:08:59] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-17 05:08:59] [INFO ] Invariant cache hit.
[2023-03-17 05:08:59] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:59] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-17 05:08:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:08:59] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-17 05:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:08:59] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 05:08:59] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:08:59] [INFO ] Added : 7 causal constraints over 2 iterations in 26 ms. Result :sat
Could not prove EG p3
Support contains 6 out of 17 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 05:08:59] [INFO ] Invariant cache hit.
[2023-03-17 05:08:59] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-17 05:08:59] [INFO ] Invariant cache hit.
[2023-03-17 05:08:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-17 05:08:59] [INFO ] Invariant cache hit.
[2023-03-17 05:08:59] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 17/17 places, 11/11 transitions.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
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 p3 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p3 (NOT p2)), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (F (G p3)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p3)), (F p2)]
Knowledge based reduction with 6 factoid took 369 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Stuttering acceptance computed with spot in 110 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
[2023-03-17 05:09:00] [INFO ] Invariant cache hit.
[2023-03-17 05:09:00] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-17 05:09:00] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:09:00] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-17 05:09:00] [INFO ] Invariant cache hit.
[2023-03-17 05:09:00] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:09:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-17 05:09:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 05:09:00] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-17 05:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 05:09:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-17 05:09:00] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 05:09:00] [INFO ] Added : 7 causal constraints over 2 iterations in 12 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 113 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Product exploration explored 100000 steps with 10000 reset in 75 ms.
Product exploration explored 100000 steps with 10000 reset in 81 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[p3, (OR (NOT p2) p3), (OR (NOT p2) p3)]
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 17 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-17 05:09:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 17 cols
[2023-03-17 05:09:01] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-17 05:09:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/17 places, 11/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41 ms. Remains : 17/17 places, 11/11 transitions.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17/17 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 17 cols
[2023-03-17 05:09:01] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-17 05:09:01] [INFO ] Implicit Places using invariants in 30 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 15/17 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 15/17 places, 11/11 transitions.
Treatment of property PermAdmissibility-COL-01-LTLFireability-15 finished in 4511 ms.
[2023-03-17 05:09:01] [INFO ] Flatten gal took : 4 ms
[2023-03-17 05:09:01] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 05:09:01] [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 17038 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1466/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PermAdmissibility-COL-01-LTLFireability-15

BK_STOP 1679029742890

--------------------
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-01-LTLFireability-15
ltl formula formula --ltl=/tmp/1466/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( 1/ 4): LTL layer: formula: /tmp/1466/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1466/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1466/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1466/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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:
malloc_consolidate(): invalid chunk size

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

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;