Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654421900088.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is PermAdmissibility-COL-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421900088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 9.5K Apr 12 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 12 09:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 12 09:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 09:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:43 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-20-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716850425642

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-20
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-27 22:53:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 22:53:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 22:53:49] [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.
[2024-05-27 22:53:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 22:53:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 740 ms
[2024-05-27 22:53:49] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 22:53:50] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 7 ms.
[2024-05-27 22:53:50] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PermAdmissibility-COL-20-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-20-LTLFireability-12 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 12 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 10004 steps, including 29 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 17) seen :16
Finished Best-First random walk after 140 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=46 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-27 22:53:50] [INFO ] Flatten gal took : 27 ms
[2024-05-27 22:53:50] [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
[2024-05-27 22:53:50] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 10 ms.
[2024-05-27 22:53:50] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 28 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
[2024-05-27 22:53:50] [INFO ] Computed 16 invariants in 5 ms
[2024-05-27 22:53:50] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-27 22:53:50] [INFO ] Invariant cache hit.
[2024-05-27 22:53:50] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-27 22:53:50] [INFO ] Invariant cache hit.
[2024-05-27 22:53:50] [INFO ] Dead Transitions using invariants and state equation in 70 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 403 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 28 out of 32 places after structural reductions.
[2024-05-27 22:53:50] [INFO ] Flatten gal took : 7 ms
[2024-05-27 22:53:50] [INFO ] Flatten gal took : 6 ms
[2024-05-27 22:53:50] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10006 steps, including 29 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 17) seen :16
Finished Best-First random walk after 294 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=147 )
Parikh walk visited 0 properties in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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.202304061127/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 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 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 8 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-05-27 22:53:51] [INFO ] Computed 12 invariants in 6 ms
[2024-05-27 22:53:51] [INFO ] Implicit Places using invariants in 106 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 109 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/32 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 15 transition count 7
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 7 transition count 5
Applied a total of 16 rules in 7 ms. Remains 7 /16 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-27 22:53:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 22:53:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-27 22:53:51] [INFO ] Invariant cache hit.
[2024-05-27 22:53:51] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
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 173 ms. Remains : 7/32 places, 5/16 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 186 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-00 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 s3 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-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 990 reset in 338 ms.
Product exploration explored 100000 steps with 990 reset in 225 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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 26 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-20-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-20-LTLFireability-00 finished in 1073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 3 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-05-27 22:53:52] [INFO ] Computed 12 invariants in 2 ms
[2024-05-27 22:53:52] [INFO ] Implicit Places using invariants in 73 ms returned [4, 5, 6, 7, 12, 13]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 75 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/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 20 transition count 13
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 19 transition count 13
Applied a total of 2 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 19 cols
[2024-05-27 22:53:52] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 22:53:52] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-27 22:53:52] [INFO ] Invariant cache hit.
[2024-05-27 22:53:52] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/32 places, 13/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 19/32 places, 13/16 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-20-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:(OR (LT s7 1) (LT s8 1) (LT s12 1)), p1:(AND (OR (LT s15 1) (LT s16 1) (LT s17 1)) (GEQ s9 1) (GEQ s11 1) (GEQ s13 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 260 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-01 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 3 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-27 22:53:52] [INFO ] Computed 14 invariants in 3 ms
[2024-05-27 22:53:52] [INFO ] Implicit Places using invariants in 95 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 96 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s1 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, null][false, false, false]]
Product exploration explored 100000 steps with 2243 reset in 437 ms.
Product exploration explored 100000 steps with 2249 reset in 228 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 171 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 211 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=211 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
// Phase 1: matrix 16 rows 18 cols
[2024-05-27 22:53:54] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 22:53:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-27 22:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:53:54] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:53:54] [INFO ] Added : 15 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 18 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 : 18/18 places, 16/16 transitions.
Graph (complete) has 21 edges and 18 vertex of which 14 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 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 4 place count 13 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 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 7 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 13 place count 7 transition count 5
Applied a total of 13 rules in 6 ms. Remains 7 /18 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-27 22:53:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 22:53:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-27 22:53:54] [INFO ] Invariant cache hit.
[2024-05-27 22:53:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-27 22:53:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:53:54] [INFO ] Invariant cache hit.
[2024-05-27 22:53:54] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/18 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 7/18 places, 5/16 transitions.
Computed a total of 7 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2024-05-27 22:53:55] [INFO ] Invariant cache hit.
[2024-05-27 22:53:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 22:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:55] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 22:53:55] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 22:53:55] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10254 reset in 101 ms.
Product exploration explored 100000 steps with 10229 reset in 90 ms.
Built C files in :
/tmp/ltsmin12682438363077365879
[2024-05-27 22:53:55] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-27 22:53:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:55] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-27 22:53:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:55] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-27 22:53:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:53:55] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12682438363077365879
Running compilation step : cd /tmp/ltsmin12682438363077365879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 314 ms.
Running link step : cd /tmp/ltsmin12682438363077365879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin12682438363077365879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6103837818945164917.hoa' '--buchi-type=spotba'
LTSmin run took 130 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-02 finished in 3288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||F(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 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
[2024-05-27 22:53:55] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 22:53:56] [INFO ] Implicit Places using invariants in 93 ms returned [5, 7, 12, 15, 16, 23, 24, 26, 27]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 99 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p2:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1)), p1:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 15225 reset in 160 ms.
Product exploration explored 100000 steps with 15112 reset in 159 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 p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1148 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 15 factoid took 1468 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
// Phase 1: matrix 16 rows 22 cols
[2024-05-27 22:53:59] [INFO ] Computed 6 invariants in 2 ms
[2024-05-27 22:53:59] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 22:53:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:53:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:53:59] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:53:59] [INFO ] Added : 15 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 35 edges and 22 vertex of which 16 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 16 transition count 9
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 3 place count 15 transition count 9
Applied a total of 3 rules in 6 ms. Remains 15 /22 variables (removed 7) and now considering 9/16 (removed 7) transitions.
// Phase 1: matrix 9 rows 15 cols
[2024-05-27 22:53:59] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 22:53:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-27 22:53:59] [INFO ] Invariant cache hit.
[2024-05-27 22:53:59] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-27 22:53:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:53:59] [INFO ] Invariant cache hit.
[2024-05-27 22:53:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 15/22 places, 9/16 transitions.
Computed a total of 15 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 9
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 p2), (X (NOT p2)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p2)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
[2024-05-27 22:54:00] [INFO ] Invariant cache hit.
[2024-05-27 22:54:00] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-27 22:54:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:54:00] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 22:54:00] [INFO ] Added : 8 causal constraints over 2 iterations in 25 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 62 ms :[(NOT p2)]
Product exploration explored 100000 steps with 24980 reset in 103 ms.
Product exploration explored 100000 steps with 24910 reset in 136 ms.
Built C files in :
/tmp/ltsmin5805204531412221775
[2024-05-27 22:54:00] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-27 22:54:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:54:00] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-27 22:54:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:54:00] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-27 22:54:00] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:54:00] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5805204531412221775
Running compilation step : cd /tmp/ltsmin5805204531412221775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 145 ms.
Running link step : cd /tmp/ltsmin5805204531412221775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5805204531412221775;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1462934495895376878.hoa' '--buchi-type=spotba'
LTSmin run took 93 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-04 finished in 5028 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 4 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /32 variables (removed 28) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-05-27 22:54:01] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 22:54:01] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 22:54:01] [INFO ] Invariant cache hit.
[2024-05-27 22:54:01] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-27 22:54:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:54:01] [INFO ] Invariant cache hit.
[2024-05-27 22:54:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s3 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 72 steps with 7 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-05 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(p1&&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 1 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-27 22:54:01] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 22:54:01] [INFO ] Implicit Places using invariants in 79 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 23, 25]
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 83 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s14 1) (LT s16 1) (LT s19 1)), p0:(OR (LT s8 1) (LT s10 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X p0), (X (OR (NOT p0) p1)), (X p1), (X (X p0)), (X (X (OR (NOT p0) p1))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-20-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-20-LTLFireability-09 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 2 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-05-27 22:54:01] [INFO ] Invariant cache hit.
[2024-05-27 22:54:01] [INFO ] Implicit Places using invariants in 96 ms returned [4, 6, 12, 13, 14, 15, 16, 18, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 97 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, p0, p0]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 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 44 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-10 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||F(p2)))'
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 20 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 18 /32 variables (removed 14) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 18 cols
[2024-05-27 22:54:02] [INFO ] Computed 8 invariants in 1 ms
[2024-05-27 22:54:02] [INFO ] Implicit Places using invariants in 61 ms returned [8, 9, 12, 14]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 63 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/32 places, 10/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 13 transition count 7
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 11 transition count 7
Applied a total of 4 rules in 4 ms. Remains 11 /14 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-05-27 22:54:02] [INFO ] Computed 4 invariants in 0 ms
[2024-05-27 22:54:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-27 22:54:02] [INFO ] Invariant cache hit.
[2024-05-27 22:54:02] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 70 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 142 ms. Remains : 11/32 places, 7/16 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p2:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)), p1:(OR (AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1)) (AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))), p0:(OR (LT s6 1) (LT s7 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7450 reset in 230 ms.
Product exploration explored 100000 steps with 7464 reset in 336 ms.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
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) (NOT p1) p0), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 545 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p2)), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 10 factoid took 739 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
[2024-05-27 22:54:04] [INFO ] Invariant cache hit.
[2024-05-27 22:54:04] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 6 ms returned sat
[2024-05-27 22:54:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 22:54:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:04] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 22:54:04] [INFO ] Computed and/alt/rep : 6/14/6 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 22:54:04] [INFO ] Added : 6 causal constraints over 2 iterations in 33 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 11 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 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-27 22:54:04] [INFO ] Invariant cache hit.
[2024-05-27 22:54:04] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-27 22:54:04] [INFO ] Invariant cache hit.
[2024-05-27 22:54:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-27 22:54:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 22:54:04] [INFO ] Invariant cache hit.
[2024-05-27 22:54:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 11/11 places, 7/7 transitions.
Computed a total of 11 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 7
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 p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
[2024-05-27 22:54:05] [INFO ] Invariant cache hit.
[2024-05-27 22:54:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 22:54:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 22:54:05] [INFO ] Computed and/alt/rep : 6/14/6 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 22:54:05] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
Product exploration explored 100000 steps with 7450 reset in 130 ms.
Product exploration explored 100000 steps with 7500 reset in 162 ms.
Built C files in :
/tmp/ltsmin15911046441136887129
[2024-05-27 22:54:05] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-27 22:54:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:54:05] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-27 22:54:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:54:05] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-27 22:54:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 22:54:05] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15911046441136887129
Running compilation step : cd /tmp/ltsmin15911046441136887129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin15911046441136887129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15911046441136887129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4882258156727650074.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-11 finished in 4178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&G(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-27 22:54:06] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 22:54:06] [INFO ] Implicit Places using invariants in 94 ms returned [4, 5, 6, 7, 12, 15, 16, 17, 19, 24, 26]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 96 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 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 98 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)) (AND (GEQ s14 1) (GEQ s16 1) (GEQ s19 1))), p0:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1) (GEQ s14 1) (GEQ s16 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-13 finished in 338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(!p1)&&p0))&&F(!p2)))'
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
[2024-05-27 22:54:06] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 22:54:06] [INFO ] Implicit Places using invariants in 78 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 23, 25]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 82 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 85 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s16 1) (GEQ s19 1)), p2:(OR (LT s8 1) (LT s10 1) (LT s12 1)), p1:(OR (LT s14 1) (LT s16 1) (LT s19 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2319 reset in 444 ms.
Product exploration explored 100000 steps with 2350 reset in 474 ms.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 438 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Incomplete random walk after 10011 steps, including 29 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 20 cols
[2024-05-27 22:54:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 22:54:08] [INFO ] After 27ms 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.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) p1))), (X (X p2)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G p2)), (F (G p1)), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT p2))]
Knowledge based reduction with 13 factoid took 1602 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
[2024-05-27 22:54:10] [INFO ] Invariant cache hit.
[2024-05-27 22:54:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 22:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:10] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:10] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 22:54:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:10] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:54:10] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:54:10] [INFO ] Added : 15 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-27 22:54:10] [INFO ] Invariant cache hit.
[2024-05-27 22:54:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:54:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:11] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:54:11] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:54:11] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG p1
[2024-05-27 22:54:11] [INFO ] Invariant cache hit.
[2024-05-27 22:54:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:11] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-27 22:54:11] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-27 22:54:11] [INFO ] Added : 3 causal constraints over 1 iterations in 51 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-27 22:54:11] [INFO ] Invariant cache hit.
[2024-05-27 22:54:11] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-27 22:54:11] [INFO ] Invariant cache hit.
[2024-05-27 22:54:11] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-27 22:54:11] [INFO ] Invariant cache hit.
[2024-05-27 22:54:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 20/20 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Finished random walk after 274 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=137 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT p0)), (X (X p2)), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT p2))]
Knowledge based reduction with 9 factoid took 394 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
[2024-05-27 22:54:12] [INFO ] Invariant cache hit.
[2024-05-27 22:54:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-27 22:54:12] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:54:12] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-27 22:54:12] [INFO ] Invariant cache hit.
[2024-05-27 22:54:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:12] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-27 22:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 22:54:12] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 22:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:54:12] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 22:54:12] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG p1
[2024-05-27 22:54:12] [INFO ] Invariant cache hit.
[2024-05-27 22:54:12] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-27 22:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 22:54:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-27 22:54:12] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-27 22:54:12] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Product exploration explored 100000 steps with 2407 reset in 173 ms.
Product exploration explored 100000 steps with 2347 reset in 199 ms.
Applying partial POR strategy [false, false, true, false]
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1 p2), (OR (NOT p0) p1), p2, p1]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 20 transition count 16
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 20 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 22 ms. Remains 18 /20 variables (removed 2) and now considering 14/16 (removed 2) transitions.
[2024-05-27 22:54:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 18 cols
[2024-05-27 22:54:14] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 22:54:14] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/20 places, 14/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 18/20 places, 14/16 transitions.
Built C files in :
/tmp/ltsmin609558970109460254
[2024-05-27 22:54:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin609558970109460254
Running compilation step : cd /tmp/ltsmin609558970109460254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 150 ms.
Running link step : cd /tmp/ltsmin609558970109460254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin609558970109460254;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8579090635973676051.hoa' '--buchi-type=spotba'
LTSmin run took 989 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-20-LTLFireability-14 finished in 8794 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 12 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 1 ms. Remains 10 /32 variables (removed 22) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-05-27 22:54:15] [INFO ] Computed 4 invariants in 0 ms
[2024-05-27 22:54:15] [INFO ] Implicit Places using invariants in 47 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 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 2 ms. Remains 7 /8 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-27 22:54:15] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 22:54:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-27 22:54:15] [INFO ] Invariant cache hit.
[2024-05-27 22:54:15] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 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 50 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-20-LTLFireability-15 finished in 179 ms.
All properties solved by simple procedures.
Total runtime 26469 ms.

BK_STOP 1716850457093

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is PermAdmissibility-COL-20, 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 r285-smll-171654421900088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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