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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Apr 12 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 12 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 09:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 09:08 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.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 12 09:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 09:16 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-02-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716846154532

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-02
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-27 21:42:36] [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:42:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:42:37] [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:42:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:42:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 682 ms
[2024-05-27 21:42:37] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 24 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 21:42:38] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 6 ms.
[2024-05-27 21:42:38] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
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 16 properties that can be checked using skeleton over-approximation.
FORMULA PermAdmissibility-COL-02-LTLFireability-06 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 2974 steps, including 61 resets, run visited all 20 properties in 61 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-27 21:42:38] [INFO ] Flatten gal took : 30 ms
[2024-05-27 21:42:38] [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 21:42:38] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 12 ms.
[2024-05-27 21:42:38] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Support contains 30 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 11 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-27 21:42:38] [INFO ] Computed 16 invariants in 8 ms
[2024-05-27 21:42:38] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-27 21:42:38] [INFO ] Invariant cache hit.
[2024-05-27 21:42:38] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-27 21:42:38] [INFO ] Invariant cache hit.
[2024-05-27 21:42:38] [INFO ] Dead Transitions using invariants and state equation in 55 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 328 ms. Remains : 32/40 places, 16/16 transitions.
Support contains 30 out of 32 places after structural reductions.
[2024-05-27 21:42:38] [INFO ] Flatten gal took : 6 ms
[2024-05-27 21:42:38] [INFO ] Flatten gal took : 7 ms
[2024-05-27 21:42:38] [INFO ] Input system was already deterministic with 16 transitions.
Finished random walk after 1998 steps, including 41 resets, run visited all 20 properties in 17 ms. (steps per millisecond=117 )
Parikh walk visited 0 properties in 0 ms.
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)))'
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:42:39] [INFO ] Computed 14 invariants in 6 ms
[2024-05-27 21:42:39] [INFO ] Implicit Places using invariants in 80 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 24, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 83 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 86 ms. Remains : 20/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 244 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-00 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 s16 1) (GEQ s18 1) (GEQ s2 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 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-00 finished in 428 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((p1||(F(p1)&&X(X(F(p2))))))&&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.
[2024-05-27 21:42:39] [INFO ] Invariant cache hit.
[2024-05-27 21:42:39] [INFO ] Implicit Places using invariants in 90 ms returned [6, 7, 11, 15, 18, 19, 20, 24, 25, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 94 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 97 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1)), p2:(OR (LT s3 1) (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 59 steps with 1 reset in 2 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-01 finished in 405 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(((p1||X(G(p2)))&&p0))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 31 transition count 16
Applied a total of 1 rules in 1 ms. Remains 31 /32 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 31 cols
[2024-05-27 21:42:40] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 21:42:40] [INFO ] Implicit Places using invariants in 80 ms returned [3, 5, 6, 7, 13, 14, 19, 21, 26]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 81 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 82 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s14 1)), p2:(AND (GEQ s17 1) (GEQ s18 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-02 finished in 224 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(p1))))'
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Applied a total of 0 rules in 5 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:42:40] [INFO ] Computed 14 invariants in 3 ms
[2024-05-27 21:42:40] [INFO ] Implicit Places using invariants in 82 ms returned [3, 5, 13, 14, 18, 19, 20, 24, 25, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 83 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 16/16 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 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 14 transition count 10
Applied a total of 12 rules in 10 ms. Remains 14 /20 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-27 21:42:40] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 21:42:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-27 21:42:40] [INFO ] Invariant cache hit.
[2024-05-27 21:42:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 14/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s8 1)), p0:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7202 reset in 278 ms.
Product exploration explored 100000 steps with 7223 reset in 210 ms.
Computed a total of 14 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 10
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 p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-27 21:42:41] [INFO ] Invariant cache hit.
[2024-05-27 21:42:41] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 21:42:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-27 21:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 21:42:41] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:42:41] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-27 21:42:41] [INFO ] Invariant cache hit.
[2024-05-27 21:42:41] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 21:42:41] [INFO ] Invariant cache hit.
[2024-05-27 21:42:41] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-27 21:42:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:41] [INFO ] Invariant cache hit.
[2024-05-27 21:42:41] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 14/14 places, 10/10 transitions.
Computed a total of 14 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 10
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 (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-27 21:42:42] [INFO ] Invariant cache hit.
[2024-05-27 21:42:42] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 21:42:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:42] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 21:42:42] [INFO ] Computed and/alt/rep : 9/17/9 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:42:42] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7222 reset in 176 ms.
Product exploration explored 100000 steps with 7221 reset in 139 ms.
Built C files in :
/tmp/ltsmin14320156069216968701
[2024-05-27 21:42:42] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-27 21:42:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:42] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-27 21:42:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:42] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-27 21:42:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:42] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14320156069216968701
Running compilation step : cd /tmp/ltsmin14320156069216968701;'/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 371 ms.
Running link step : cd /tmp/ltsmin14320156069216968701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin14320156069216968701;'/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/stateBased6895576288357653491.hoa' '--buchi-type=spotba'
LTSmin run took 81 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-03 finished in 2979 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 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:42:43] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 21:42:43] [INFO ] Implicit Places using invariants in 72 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 20, 21, 25, 26, 27]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 75 ms to find 13 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 77 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-04 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 s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-04 finished in 176 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) U (!p1&&X(!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 21:42:43] [INFO ] Computed 15 invariants in 2 ms
[2024-05-27 21:42:43] [INFO ] Implicit Places using invariants in 74 ms returned [6, 7, 11, 15, 19, 21, 25, 26, 27]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 75 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 77 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR p1 p2), p0, (OR p1 p2), p2, (AND p0 (NOT p1) p2)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 p0 p2), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 1}]], initial=0, aps=[p1:(OR (NOT (AND (GEQ s6 1) (GEQ s10 1) (GEQ s11 1))) (AND (GEQ s14 1) (GEQ s15 1) (GEQ s16 1))), p0:(OR (LT s3 1) (LT s4 1) (LT s5 1)), p2:(AND (GEQ s6 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4739 reset in 109 ms.
Product exploration explored 100000 steps with 4737 reset in 105 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 p1 p0 (NOT p2)), (X (AND p1 p0)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1318 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 17 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR p1 p2), p0, (OR p1 p2), p2, false, false]
Incomplete random walk after 10000 steps, including 208 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16 rows 22 cols
[2024-05-27 21:42:45] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 21:42:45] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (AND p1 p0)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 p2))), (X p0), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X p0)), (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 p2)), (F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND p1 p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 22 factoid took 1896 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-05 finished in 4331 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(F(p0))&&G((F(p2)&&p1)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 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:42:47] [INFO ] Computed 14 invariants in 2 ms
[2024-05-27 21:42:47] [INFO ] Implicit Places using invariants in 68 ms returned [6, 7, 11, 15, 18, 19, 20, 25]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 69 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s10 1) (GEQ s11 1)), p2:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s18 1)), p0:(OR (LT s3 1) (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 5 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-07 finished in 361 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)||X((G(F(p1))||((p0 U !p3)&&p2)))))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 4 ms. Remains 30 /32 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-05-27 21:42:48] [INFO ] Invariant cache hit.
[2024-05-27 21:42:48] [INFO ] Implicit Places using invariants in 62 ms returned [6, 7, 11, 15, 18, 19, 24, 26]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 64 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 22/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s18 1) (GEQ s19 1)), p2:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1)), p3:(OR (LT s3 1) (LT s4 1) (LT s5 1)), p1:(AND (GEQ s8 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9663 reset in 100 ms.
Product exploration explored 100000 steps with 9692 reset in 101 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) p3 (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))), (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 1555 steps, including 32 resets, run visited all 4 properties in 4 ms. (steps per millisecond=388 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))), (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p3)), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 235 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
// Phase 1: matrix 16 rows 22 cols
[2024-05-27 21:42:49] [INFO ] Computed 6 invariants in 0 ms
[2024-05-27 21:42:49] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-27 21:42:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-27 21:42:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:49] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-27 21:42:49] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:42:49] [INFO ] Added : 15 causal constraints over 3 iterations in 26 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 16/16 transitions.
Graph (complete) has 37 edges and 22 vertex of which 20 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 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 19 transition count 10
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 16 transition count 10
Applied a total of 7 rules in 6 ms. Remains 16 /22 variables (removed 6) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-05-27 21:42:49] [INFO ] Computed 6 invariants in 0 ms
[2024-05-27 21:42:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-27 21:42:49] [INFO ] Invariant cache hit.
[2024-05-27 21:42:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-27 21:42:49] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:49] [INFO ] Invariant cache hit.
[2024-05-27 21:42:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 16/22 places, 10/16 transitions.
Computed a total of 16 stabilizing places and 10 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 10
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 (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 213 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Finished random walk after 2343 steps, including 76 resets, run visited all 4 properties in 4 ms. (steps per millisecond=585 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 11 factoid took 461 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
[2024-05-27 21:42:51] [INFO ] Invariant cache hit.
[2024-05-27 21:42:51] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:51] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 21:42:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:51] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:51] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-27 21:42:51] [INFO ] Computed and/alt/rep : 9/21/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 21:42:51] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 18109 reset in 88 ms.
Product exploration explored 100000 steps with 18134 reset in 98 ms.
Built C files in :
/tmp/ltsmin4496160647690560898
[2024-05-27 21:42:51] [INFO ] Computing symmetric may disable matrix : 10 transitions.
[2024-05-27 21:42:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:51] [INFO ] Computing symmetric may enable matrix : 10 transitions.
[2024-05-27 21:42:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:51] [INFO ] Computing Do-Not-Accords matrix : 10 transitions.
[2024-05-27 21:42:51] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4496160647690560898
Running compilation step : cd /tmp/ltsmin4496160647690560898;'/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 102 ms.
Running link step : cd /tmp/ltsmin4496160647690560898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin4496160647690560898;'/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/stateBased892913763039435484.hoa' '--buchi-type=spotba'
LTSmin run took 47 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-08 finished in 3633 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))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 16 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 14 /32 variables (removed 18) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 14 cols
[2024-05-27 21:42:51] [INFO ] Computed 6 invariants in 0 ms
[2024-05-27 21:42:51] [INFO ] Implicit Places using invariants in 30 ms returned [3, 7, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/32 places, 8/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
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 6 place count 6 transition count 4
Applied a total of 6 rules in 4 ms. Remains 6 /10 variables (removed 4) and now considering 4/8 (removed 4) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-27 21:42:51] [INFO ] Computed 2 invariants in 1 ms
[2024-05-27 21:42:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-27 21:42:51] [INFO ] Invariant cache hit.
[2024-05-27 21:42:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/32 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 91 ms. Remains : 6/32 places, 4/16 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19529 reset in 70 ms.
Product exploration explored 100000 steps with 19518 reset in 88 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 86 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 33 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 103 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2024-05-27 21:42:52] [INFO ] Invariant cache hit.
[2024-05-27 21:42:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-27 21:42:52] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 21:42:52] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-27 21:42:52] [INFO ] Invariant cache hit.
[2024-05-27 21:42:52] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-27 21:42:52] [INFO ] Invariant cache hit.
[2024-05-27 21:42:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-27 21:42:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:52] [INFO ] Invariant cache hit.
[2024-05-27 21:42:52] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 88 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 36 ms :[(NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
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 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-27 21:42:52] [INFO ] Invariant cache hit.
[2024-05-27 21:42:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:52] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-27 21:42:52] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-27 21:42:52] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 87 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19537 reset in 60 ms.
Product exploration explored 100000 steps with 19540 reset in 65 ms.
Built C files in :
/tmp/ltsmin17357282396455586977
[2024-05-27 21:42:53] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-27 21:42:53] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:53] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-27 21:42:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:53] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-27 21:42:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17357282396455586977
Running compilation step : cd /tmp/ltsmin17357282396455586977;'/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 79 ms.
Running link step : cd /tmp/ltsmin17357282396455586977;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17357282396455586977;'/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/stateBased6475632284569765895.hoa' '--buchi-type=spotba'
LTSmin run took 42 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-09 finished in 1520 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)||F(p1)||((!p0 U p2) U p3)))'
Support contains 10 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 28 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 26 /32 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-05-27 21:42:53] [INFO ] Computed 12 invariants in 1 ms
[2024-05-27 21:42:53] [INFO ] Implicit Places using invariants in 49 ms returned [9, 10, 14, 15, 20, 22]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 50 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/32 places, 14/16 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 20 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 17 transition count 11
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-27 21:42:53] [INFO ] Computed 6 invariants in 1 ms
[2024-05-27 21:42:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 21:42:53] [INFO ] Invariant cache hit.
[2024-05-27 21:42:53] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/32 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 17/32 places, 11/16 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND p0 (NOT p1) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s2 1) (LT s3 1)), p1:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s15 1)), p3:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s14 1)), p2:(AND (GEQ s4 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 8290 reset in 78 ms.
Product exploration explored 100000 steps with 8292 reset in 94 ms.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 169 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p3) p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 21 factoid took 215 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 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
[2024-05-27 21:42:54] [INFO ] Invariant cache hit.
[2024-05-27 21:42:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-27 21:42:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:54] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-27 21:42:54] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:42:54] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 17 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 : 17/17 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 17 /17 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-05-27 21:42:54] [INFO ] Invariant cache hit.
[2024-05-27 21:42:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-27 21:42:54] [INFO ] Invariant cache hit.
[2024-05-27 21:42:54] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-27 21:42:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-27 21:42:54] [INFO ] Invariant cache hit.
[2024-05-27 21:42:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 17/17 places, 11/11 transitions.
Computed a total of 17 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17 transition count 11
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 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 33 ms :[(NOT p1)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 100 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 32 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
[2024-05-27 21:42:54] [INFO ] Invariant cache hit.
[2024-05-27 21:42:54] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-27 21:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-27 21:42:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 21:42:55] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-27 21:42:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 21:42:55] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-27 21:42:55] [INFO ] Computed and/alt/rep : 10/22/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:42:55] [INFO ] Added : 10 causal constraints over 2 iterations in 29 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 8291 reset in 72 ms.
Product exploration explored 100000 steps with 8271 reset in 86 ms.
Built C files in :
/tmp/ltsmin10194012343353298561
[2024-05-27 21:42:55] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2024-05-27 21:42:55] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:55] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2024-05-27 21:42:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:55] [INFO ] Computing Do-Not-Accords matrix : 11 transitions.
[2024-05-27 21:42:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 21:42:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10194012343353298561
Running compilation step : cd /tmp/ltsmin10194012343353298561;'/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 90 ms.
Running link step : cd /tmp/ltsmin10194012343353298561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin10194012343353298561;'/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/stateBased16513397288675631231.hoa' '--buchi-type=spotba'
LTSmin run took 39 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-10 finished in 2081 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 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 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 0 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:42:55] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 21:42:55] [INFO ] Implicit Places using invariants in 68 ms returned [3, 5, 6, 7, 11, 13, 14, 15, 20, 21, 25, 26, 27]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 70 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/32 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 18/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 59 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 (NOT p0)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 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-02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-11 finished in 300 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))'
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 8 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 2 ms. Remains 7 /32 variables (removed 25) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 7 cols
[2024-05-27 21:42:55] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 21:42:55] [INFO ] Implicit Places using invariants in 20 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 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.
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 5 transition count 2
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 4 transition count 2
Applied a total of 2 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 2/4 (removed 2) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-05-27 21:42:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 21:42:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-27 21:42:55] [INFO ] Invariant cache hit.
[2024-05-27 21:42:55] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/32 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 4/32 places, 2/16 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 56 ms.
Computed a total of 4 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLFireability-12 finished in 282 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||X(F((!p0&&F((!p0 U (G(!p0)||(!p0&&G(!p1))))))))) U G(p2)))'
Support contains 9 out of 32 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Graph (complete) has 81 edges and 32 vertex of which 24 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 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 1 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:42:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-27 21:42:56] [INFO ] Implicit Places using invariants in 45 ms returned [3, 7, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 46 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/32 places, 12/16 transitions.
Reduce places removed 1 places and 1 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 17 transition count 10
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 16 transition count 10
Applied a total of 2 rules in 2 ms. Remains 16 /18 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 16 cols
[2024-05-27 21:42:56] [INFO ] Computed 6 invariants in 0 ms
[2024-05-27 21:42:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-27 21:42:56] [INFO ] Invariant cache hit.
[2024-05-27 21:42:56] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/32 places, 10/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 99 ms. Remains : 16/32 places, 10/16 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), p0, false, (AND p0 p1), false]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={1} source=0 dest: 0}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s11 1) (GEQ s14 1)), p0:(AND (GEQ s9 1) (GEQ s10 1) (GEQ s12 1)), p1:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 146 steps with 6 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-13 finished in 324 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 (F(p1) U X(X(p2)))) U p2))'
Support contains 7 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 16
Applied a total of 2 rules in 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:42:56] [INFO ] Computed 14 invariants in 1 ms
[2024-05-27 21:42:56] [INFO ] Implicit Places using invariants in 58 ms returned [3, 5, 11, 13, 14, 15, 18, 19, 24, 26]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 60 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 63 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 517 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}, { cond=true, acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(NOT p0), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 9}, { cond=p0, acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p2) p0), acceptance={0} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 12}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s5 1)), p1:(AND (GEQ s12 1) (GEQ s16 1) (GEQ s18 1)), p0:(AND (GEQ s2 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, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5725 reset in 70 ms.
Product exploration explored 100000 steps with 5718 reset in 81 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 p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 2042 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 507 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 43 steps, including 0 resets, run visited all 10 properties in 5 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 7331 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 500 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 16 rows 20 cols
[2024-05-27 21:43:08] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 21:43:08] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-27 21:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:43:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-27 21:43:08] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-27 21:43:08] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-27 21:43:08] [INFO ] Invariant cache hit.
[2024-05-27 21:43:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-27 21:43:08] [INFO ] Invariant cache hit.
[2024-05-27 21:43:08] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-27 21:43:08] [INFO ] Invariant cache hit.
[2024-05-27 21:43:08] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 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 p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), true, (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 24 factoid took 1881 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Finished random walk after 43 steps, including 0 resets, run visited all 10 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), true, (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 24 factoid took 7103 ms. Reduced automaton from 13 states, 29 edges and 3 AP (stutter sensitive) to 13 states, 29 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 486 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 483 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
[2024-05-27 21:43:18] [INFO ] Invariant cache hit.
[2024-05-27 21:43:18] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-27 21:43:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 21:43:18] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-27 21:43:18] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-27 21:43:18] [INFO ] Added : 13 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 653 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5713 reset in 73 ms.
Product exploration explored 100000 steps with 5714 reset in 95 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 486 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 7 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 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 4 place count 20 transition count 16
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 16
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 12 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 16 place count 16 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 10 ms. Remains 16 /20 variables (removed 4) and now considering 12/16 (removed 4) transitions.
[2024-05-27 21:43:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 16 cols
[2024-05-27 21:43:20] [INFO ] Computed 4 invariants in 1 ms
[2024-05-27 21:43:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/20 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 16/20 places, 12/16 transitions.
Built C files in :
/tmp/ltsmin6805227589515955223
[2024-05-27 21:43:20] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6805227589515955223
Running compilation step : cd /tmp/ltsmin6805227589515955223;'/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 100 ms.
Running link step : cd /tmp/ltsmin6805227589515955223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6805227589515955223;'/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/stateBased10036053765645346254.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLFireability-14 finished in 24223 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&&G(!p1)) U G(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 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:43:20] [INFO ] Computed 15 invariants in 0 ms
[2024-05-27 21:43:20] [INFO ] Implicit Places using invariants in 50 ms returned [3, 5, 6, 7, 11, 15, 20, 21, 25, 26, 27]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 54 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 56 ms. Remains : 20/32 places, 16/16 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), true, p1, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s8 1) (GEQ s9 1)), p1:(AND (GEQ s10 1) (GEQ s12 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLFireability-15 finished in 228 ms.
All properties solved by simple procedures.
Total runtime 43837 ms.

BK_STOP 1716846202351

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

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

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