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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 9.6K Apr 12 09:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 12 09:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 09:12 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.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 14K Apr 12 09:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 09:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 09:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 09:25 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-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 1716845868285

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-01
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-27 21:37:51] [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 21:37:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:37:52] [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 21:37:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:37:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1154 ms
[2024-05-27 21:37:53] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 39 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 47 ms.
Working with output stream class java.io.PrintStream
[2024-05-27 21:37:53] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 10 ms.
[2024-05-27 21:37:53] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA PermAdmissibility-COL-01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-01-LTLFireability-13 FALSE 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.
FORMULA PermAdmissibility-COL-01-LTLFireability-01 FALSE 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).
Finished random walk after 15 steps, including 0 resets, run visited all 17 properties in 20 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 1 ms.
[2024-05-27 21:37:53] [INFO ] Flatten gal took : 39 ms
[2024-05-27 21:37:53] [INFO ] Flatten gal took : 13 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 21:37:53] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 16 ms.
[2024-05-27 21:37:53] [INFO ] Unfolded 13 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 14 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 21:37:53] [INFO ] Computed 16 invariants in 14 ms
[2024-05-27 21:37:54] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-27 21:37:54] [INFO ] Invariant cache hit.
[2024-05-27 21:37:54] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-27 21:37:54] [INFO ] Invariant cache hit.
[2024-05-27 21:37:54] [INFO ] Dead Transitions using invariants and state equation in 81 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 426 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 31 out of 32 places after structural reductions.
[2024-05-27 21:37:54] [INFO ] Flatten gal took : 5 ms
[2024-05-27 21:37:54] [INFO ] Flatten gal took : 6 ms
[2024-05-27 21:37:54] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 15 properties in 5 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA PermAdmissibility-COL-01-LTLFireability-04 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' '!(X((G((p0 U p1))||((p0 U p1)&&X(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 2 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 21:37:54] [INFO ] Computed 15 invariants in 10 ms
[2024-05-27 21:37:55] [INFO ] Implicit Places using invariants in 91 ms returned [5, 7, 14, 15, 16, 17, 19, 24, 26]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 93 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 97 ms. Remains : 22/32 places, 16/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 596 ms :[(NOT p1), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR p1 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 1)), p0:(AND (GEQ s16 1) (GEQ s18 1) (GEQ s21 1)), p2:(OR (LT s6 1) (LT s7 1) (LT s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-00 finished in 794 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))&&F(p1)))'
Support contains 4 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.2 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 9 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-05-27 21:37:55] [INFO ] Computed 3 invariants in 1 ms
[2024-05-27 21:37:55] [INFO ] Implicit Places using invariants in 48 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 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 2 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 61 ms. Remains : 5/32 places, 3/16 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (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=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s2 1) (LT s3 1) (LT s4 1)), p0:(OR (LT s1 1) (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 25000 reset in 536 ms.
Product exploration explored 100000 steps with 25000 reset in 293 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 : [(AND p1 p0), (X (NOT p1)), (X p0), (X (X p1)), (X (X (NOT p0))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 31 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-02 finished in 1205 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.
// Phase 1: matrix 16 rows 30 cols
[2024-05-27 21:37:56] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 21:37:56] [INFO ] Implicit Places using invariants in 114 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 116 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 120 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-03 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 s10 1) (GEQ s12 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 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-03 finished in 268 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 3 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-05-27 21:37:57] [INFO ] Invariant cache hit.
[2024-05-27 21:37:57] [INFO ] Implicit Places using invariants in 118 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 123 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 128 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-05 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 s12 1) (GEQ s14 1) (GEQ s17 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 1 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-05 finished in 270 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(F(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 21:37:57] [INFO ] Invariant cache hit.
[2024-05-27 21:37:57] [INFO ] Implicit Places using invariants in 143 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 22, 23, 25, 26]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 145 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 148 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s12 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 16666 reset in 576 ms.
Product exploration explored 100000 steps with 16666 reset in 166 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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 16 rows 18 cols
[2024-05-27 21:37:59] [INFO ] Computed 2 invariants in 2 ms
[2024-05-27 21:37:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 21:37:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:37:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-27 21:37:59] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:37:59] [INFO ] Added : 3 causal constraints over 1 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 18 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 18/18 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.
[2024-05-27 21:37:59] [INFO ] Invariant cache hit.
[2024-05-27 21:37:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-27 21:37:59] [INFO ] Invariant cache hit.
[2024-05-27 21:37:59] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-27 21:37:59] [INFO ] Invariant cache hit.
[2024-05-27 21:37:59] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 18/18 places, 16/16 transitions.
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 : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-27 21:38:00] [INFO ] Invariant cache hit.
[2024-05-27 21:38:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 21:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:38:00] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-27 21:38:00] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-27 21:38:00] [INFO ] Added : 3 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 317 ms.
Product exploration explored 100000 steps with 16666 reset in 130 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 18 places. Attempting structural reductions.
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 8 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 8 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 3 rules in 9 ms. Remains 8 /18 variables (removed 10) and now considering 6/16 (removed 10) transitions.
[2024-05-27 21:38:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2024-05-27 21:38:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 21:38:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/18 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 8/18 places, 6/16 transitions.
Built C files in :
/tmp/ltsmin8534728484375456666
[2024-05-27 21:38:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8534728484375456666
Running compilation step : cd /tmp/ltsmin8534728484375456666;'/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 497 ms.
Running link step : cd /tmp/ltsmin8534728484375456666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin8534728484375456666;'/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/stateBased15458567214859951546.hoa' '--buchi-type=spotba'
LTSmin run took 247 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-01-LTLFireability-06 finished in 5131 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)))'
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 21:38:02] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 21:38:02] [INFO ] Implicit Places using invariants in 130 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 16, 18]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 135 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 138 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
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={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s16 1) (LT s17 1) (AND (GEQ s13 1) (GEQ s14 1) (GEQ s15 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 109 ms.
Product exploration explored 100000 steps with 50000 reset in 110 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 (Minato strategy)
Knowledge based reduction with 4 factoid took 20 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-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-07 finished in 547 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) U !p1) U X(p2)))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 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 2 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 21:38:03] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 21:38:03] [INFO ] Implicit Places using invariants in 116 ms returned [4, 6, 12, 15, 16, 17, 19, 23, 24, 26, 27]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 118 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 121 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (NOT p2), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), true, p0, p1]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 p0), acceptance={0} source=6 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s9 1) (LT s10 1) (LT s11 1)), p0:(OR (LT s8 1) (LT s10 1) (LT s11 1)), p2:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-08 finished in 541 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((G(p0)||X((G(F(!p1)) U (!p2 U p3))))))'
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 2 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 21:38:03] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 21:38:03] [INFO ] Implicit Places using invariants in 82 ms returned [5, 7, 14, 17, 19, 23, 27]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 84 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 87 ms. Remains : 24/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 380 ms :[(AND (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3) p2 p1), p1, p1, (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p1 p3))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1)), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p3) (AND p0 (NOT p2))), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s12 1) (LT s13 1) (LT s15 1)), p3:(AND (GEQ s18 1) (GEQ s20 1) (GEQ s22 1)), p2:(OR (LT s6 1) (LT s7 1) (LT s11 1)), p1:(AND (GEQ s3 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28044 reset in 299 ms.
Product exploration explored 100000 steps with 28110 reset in 320 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p0 p3) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p3))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 273 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p3) p2 p1))), (X (NOT (AND (NOT p0) (NOT p3) p2 p1))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT p3)), (X (NOT (AND (NOT p0) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2 p1)))), (X (X (NOT (OR (AND (NOT p0) p3 p1) (AND (NOT p0) (NOT p2) p1))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (OR (AND p0 p3) (AND p0 (NOT p2)))))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT p3))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p3))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p3)]
Knowledge based reduction with 19 factoid took 332 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Support contains 6 out of 24 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 : 24/24 places, 16/16 transitions.
Graph (complete) has 43 edges and 24 vertex of which 22 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 22 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 19 transition count 11
Applied a total of 7 rules in 6 ms. Remains 19 /24 variables (removed 5) and now considering 11/16 (removed 5) transitions.
// Phase 1: matrix 11 rows 19 cols
[2024-05-27 21:38:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-27 21:38:05] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-27 21:38:05] [INFO ] Invariant cache hit.
[2024-05-27 21:38:05] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-27 21:38:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:38:05] [INFO ] Invariant cache hit.
[2024-05-27 21:38:05] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/24 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 19/24 places, 11/16 transitions.
Computed a total of 19 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 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 p0 (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Finished random walk after 10 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3)), (X (NOT p3)), (X (X (NOT p3))), (F (G p0)), (F (G (NOT p3)))]
False Knowledge obtained : [(F (NOT p0)), (F p3)]
Knowledge based reduction with 5 factoid took 250 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 8693 reset in 450 ms.
Product exploration explored 100000 steps with 8700 reset in 319 ms.
Built C files in :
/tmp/ltsmin15006920102319909001
[2024-05-27 21:38:07] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-27 21:38:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:38:07] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-27 21:38:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:38:07] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-27 21:38:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:38:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15006920102319909001
Running compilation step : cd /tmp/ltsmin15006920102319909001;'/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 155 ms.
Running link step : cd /tmp/ltsmin15006920102319909001;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15006920102319909001;'/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/stateBased4759444966777197529.hoa' '--buchi-type=spotba'
LTSmin run took 121 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-01-LTLFireability-09 finished in 4366 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(p0)&&F(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 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 21:38:07] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 21:38:08] [INFO ] Implicit Places using invariants in 83 ms returned [4, 6, 12, 13, 16, 18, 22, 23, 25, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 85 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 87 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s10 1) (LT s11 1) (LT s15 1)), p0:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][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-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-01-LTLFireability-11 finished in 286 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((p0||G((G(p1) 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 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 4 ms. Remains 22 /32 variables (removed 10) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 22 cols
[2024-05-27 21:38:08] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 21:38:08] [INFO ] Implicit Places using invariants in 58 ms returned [12, 13, 14, 15, 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 SI_LTL mode, iteration 1 : 16/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 15 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 13 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 12 transition count 8
Applied a total of 6 rules in 6 ms. Remains 12 /16 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-05-27 21:38:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-27 21:38:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-27 21:38:08] [INFO ] Invariant cache hit.
[2024-05-27 21:38:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 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 138 ms. Remains : 12/32 places, 8/16 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s6 1)), p2:(AND (GEQ s1 1) (GEQ s5 1) (GEQ s7 1)), p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 16666 reset in 255 ms.
Product exploration explored 100000 steps with 16666 reset in 278 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1263 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 3 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 1111 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 1111 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 21:38:10] [INFO ] Invariant cache hit.
[2024-05-27 21:38:10] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 21:38:10] [INFO ] After 71ms 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) (NOT p2) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (AND (NOT p0) (NOT p2) (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 15 factoid took 3512 ms. Reduced automaton from 3 states, 11 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 59 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
[2024-05-27 21:38:14] [INFO ] Invariant cache hit.
[2024-05-27 21:38:14] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-27 21:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:38:14] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 21:38:14] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:38:14] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 7 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-05-27 21:38:14] [INFO ] Invariant cache hit.
[2024-05-27 21:38:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-27 21:38:14] [INFO ] Invariant cache hit.
[2024-05-27 21:38:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-27 21:38:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:38:14] [INFO ] Invariant cache hit.
[2024-05-27 21:38:14] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 397 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 680 ms. Reduced automaton from 1 states, 2 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 54 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
[2024-05-27 21:38:16] [INFO ] Invariant cache hit.
[2024-05-27 21:38:16] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 21:38:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:38:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-27 21:38:16] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:38:16] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 60 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 16666 reset in 179 ms.
Product exploration explored 100000 steps with 16666 reset in 202 ms.
Built C files in :
/tmp/ltsmin12737352621856924259
[2024-05-27 21:38:16] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2024-05-27 21:38:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:38:16] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2024-05-27 21:38:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:38:16] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2024-05-27 21:38:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:38:16] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12737352621856924259
Running compilation step : cd /tmp/ltsmin12737352621856924259;'/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 155 ms.
Running link step : cd /tmp/ltsmin12737352621856924259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12737352621856924259;'/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/stateBased11598665451442498017.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA PermAdmissibility-COL-01-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-01-LTLFireability-12 finished in 8692 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 U p1)||X(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 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 21:38:16] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 21:38:17] [INFO ] Implicit Places using invariants in 79 ms returned [5, 7, 12, 15, 16, 17, 19, 23, 24, 26, 27]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 81 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : PermAdmissibility-COL-01-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s10 1) (LT s11 1)), p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p2:(OR (LT s3 1) (LT s4 1) (LT s5 1) (AND (GEQ s8 1) (GEQ s10 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9177 reset in 109 ms.
Product exploration explored 100000 steps with 9185 reset in 129 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 (NOT p0) p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (G p1)), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 29 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-01-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-01-LTLFireability-15 finished in 656 ms.
All properties solved by simple procedures.
Total runtime 25801 ms.

BK_STOP 1716845899136

--------------------
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-01"
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-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 r285-smll-171654421900068"
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 ;