Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r329-tall-167889202100476.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Referendum-PT-0015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202100476
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 19K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 17:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K Feb 26 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 25K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 209K Feb 26 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Referendum-PT-0015-LTLFireability-00
FORMULA_NAME Referendum-PT-0015-LTLFireability-01
FORMULA_NAME Referendum-PT-0015-LTLFireability-02
FORMULA_NAME Referendum-PT-0015-LTLFireability-03
FORMULA_NAME Referendum-PT-0015-LTLFireability-04
FORMULA_NAME Referendum-PT-0015-LTLFireability-05
FORMULA_NAME Referendum-PT-0015-LTLFireability-06
FORMULA_NAME Referendum-PT-0015-LTLFireability-07
FORMULA_NAME Referendum-PT-0015-LTLFireability-08
FORMULA_NAME Referendum-PT-0015-LTLFireability-09
FORMULA_NAME Referendum-PT-0015-LTLFireability-10
FORMULA_NAME Referendum-PT-0015-LTLFireability-11
FORMULA_NAME Referendum-PT-0015-LTLFireability-12
FORMULA_NAME Referendum-PT-0015-LTLFireability-13
FORMULA_NAME Referendum-PT-0015-LTLFireability-14
FORMULA_NAME Referendum-PT-0015-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679135919855

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0015
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 10:38:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 10:38:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:38:41] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-18 10:38:41] [INFO ] Transformed 46 places.
[2023-03-18 10:38:41] [INFO ] Transformed 31 transitions.
[2023-03-18 10:38:41] [INFO ] Found NUPN structural information;
[2023-03-18 10:38:41] [INFO ] Parsed PT model containing 46 places and 31 transitions and 76 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Referendum-PT-0015-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16 transition count 16
Applied a total of 45 rules in 113 ms. Remains 16 /46 variables (removed 30) and now considering 16/31 (removed 15) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-18 10:38:41] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 10:38:41] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-18 10:38:41] [INFO ] Invariant cache hit.
[2023-03-18 10:38:41] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-18 10:38:41] [INFO ] Invariant cache hit.
[2023-03-18 10:38:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/46 places, 16/31 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 16/46 places, 16/31 transitions.
Support contains 16 out of 16 places after structural reductions.
[2023-03-18 10:38:42] [INFO ] Flatten gal took : 13 ms
[2023-03-18 10:38:42] [INFO ] Flatten gal took : 5 ms
[2023-03-18 10:38:42] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 588 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:42] [INFO ] Invariant cache hit.
[2023-03-18 10:38:42] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:38:42] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Referendum-PT-0015-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Referendum-PT-0015-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(F(p1)))))'
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:38:42] [INFO ] Invariant cache hit.
[2023-03-18 10:38:42] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:38:42] [INFO ] Invariant cache hit.
[2023-03-18 10:38:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 10:38:42] [INFO ] Invariant cache hit.
[2023-03-18 10:38:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s0 1) (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0015-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLFireability-00 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||G(p1)))||F(G(p1))))'
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:38:43] [INFO ] Invariant cache hit.
[2023-03-18 10:38:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 10:38:43] [INFO ] Invariant cache hit.
[2023-03-18 10:38:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 10:38:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:43] [INFO ] Invariant cache hit.
[2023-03-18 10:38:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0) (EQ s11 0) (EQ s12 0) (EQ s13 0) (EQ s14 0) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5882 reset in 252 ms.
Product exploration explored 100000 steps with 5882 reset in 160 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 174 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLFireability-02 finished in 925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(p1&&F(p2))))||G(p1)))'
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:38:44] [INFO ] Invariant cache hit.
[2023-03-18 10:38:44] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 10:38:44] [INFO ] Invariant cache hit.
[2023-03-18 10:38:44] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 10:38:44] [INFO ] Invariant cache hit.
[2023-03-18 10:38:44] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s0 1), p2:(AND (EQ s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0) (EQ s11 0) (EQ s12 0) (EQ s13 0...], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24984 reset in 208 ms.
Product exploration explored 100000 steps with 24966 reset in 167 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 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 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (G (NOT p1))), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 888 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:45] [INFO ] Invariant cache hit.
[2023-03-18 10:38:45] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (G (NOT p1))), (F (G p2)), (F (G p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 833 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 1 out of 16 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 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 3 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:38:46] [INFO ] Invariant cache hit.
[2023-03-18 10:38:47] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 10:38:47] [INFO ] Invariant cache hit.
[2023-03-18 10:38:47] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 10:38:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:47] [INFO ] Invariant cache hit.
[2023-03-18 10:38:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 16/16 places, 16/16 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 323 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:47] [INFO ] Invariant cache hit.
[2023-03-18 10:38:47] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 335 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, false, (NOT p0)]
Product exploration explored 100000 steps with 5882 reset in 176 ms.
Product exploration explored 100000 steps with 5882 reset in 133 ms.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (complete) has 15 edges and 16 vertex of which 1 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Applied a total of 1 rules in 3 ms. Remains 1 /16 variables (removed 15) and now considering 1/16 (removed 15) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 10:38:48] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:38:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 10:38:48] [INFO ] Invariant cache hit.
[2023-03-18 10:38:48] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-18 10:38:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:48] [INFO ] Invariant cache hit.
[2023-03-18 10:38:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/16 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 1/16 places, 1/16 transitions.
Treatment of property Referendum-PT-0015-LTLFireability-03 finished in 4428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(F(p1)&&G(p2))))))'
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-18 10:38:48] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 10:38:48] [INFO ] Invariant cache hit.
[2023-03-18 10:38:48] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-18 10:38:48] [INFO ] Invariant cache hit.
[2023-03-18 10:38:48] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 1), p2:(EQ s0 0), p1:(AND (EQ s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0) (EQ s11 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9888 reset in 104 ms.
Product exploration explored 100000 steps with 9772 reset in 160 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND (NOT p0) (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 587 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND (NOT p0) (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 16 factoid took 617 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p2), (NOT p2)]
[2023-03-18 10:38:50] [INFO ] Invariant cache hit.
[2023-03-18 10:38:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:38:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-18 10:38:50] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-18 10:38:50] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:38:50] [INFO ] Invariant cache hit.
[2023-03-18 10:38:50] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 10:38:50] [INFO ] Invariant cache hit.
[2023-03-18 10:38:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-18 10:38:50] [INFO ] Invariant cache hit.
[2023-03-18 10:38:50] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 16/16 places, 16/16 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 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 p2), (X p2), true, (X (X p2)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (X p2), true, (X (X p2)), (F (G p2))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 5 factoid took 217 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
[2023-03-18 10:38:51] [INFO ] Invariant cache hit.
[2023-03-18 10:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:38:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-18 10:38:51] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 10:38:51] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 5882 reset in 92 ms.
Product exploration explored 100000 steps with 5882 reset in 103 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (complete) has 15 edges and 16 vertex of which 1 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /16 variables (removed 15) and now considering 1/16 (removed 15) transitions.
[2023-03-18 10:38:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 10:38:51] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:51] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/16 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25 ms. Remains : 1/16 places, 1/16 transitions.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2 transition count 2
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2 transition count 2
Applied a total of 28 rules in 6 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 10:38:51] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 10:38:51] [INFO ] Invariant cache hit.
[2023-03-18 10:38:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-18 10:38:51] [INFO ] Invariant cache hit.
[2023-03-18 10:38:51] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/16 places, 2/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 2/16 places, 2/16 transitions.
Treatment of property Referendum-PT-0015-LTLFireability-04 finished in 3393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 15 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-18 10:38:51] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:38:51] [INFO ] Invariant cache hit.
[2023-03-18 10:38:52] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-18 10:38:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:52] [INFO ] Invariant cache hit.
[2023-03-18 10:38:52] [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 86 ms. Remains : 16/16 places, 16/16 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s2 1) (EQ s3 1) (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s7 1) (EQ s8 1) (EQ s9 1) (EQ s10 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s14 1) (E...], 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 89 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 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 p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLFireability-07 finished in 438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(p1)))&&F((G(F(p2))||(!p2&&F(p2))))))'
Support contains 3 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 5 transition count 5
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 5 transition count 5
Applied a total of 22 rules in 1 ms. Remains 5 /16 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-18 10:38:52] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:52] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 10:38:52] [INFO ] Invariant cache hit.
[2023-03-18 10:38:52] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 10:38:52] [INFO ] Invariant cache hit.
[2023-03-18 10:38:52] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/16 places, 5/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 5/16 places, 5/16 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), (NOT p1), true]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s3 1), p0:(EQ s4 1), p1:(EQ s2 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]]
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X p0), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 174 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLFireability-08 finished in 602 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(G(p0))))&&(!p0 U (p1||G(!p0)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4 transition count 4
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4 transition count 4
Applied a total of 24 rules in 1 ms. Remains 4 /16 variables (removed 12) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 10:38:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/16 places, 4/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 4/16 places, 4/16 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (AND (NOT p1) p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NEQ s1 1) (NEQ s3 1)), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0015-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLFireability-09 finished in 254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((!p1&&X(p0))||X(G(p0)))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 4 transition count 4
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 4 transition count 4
Applied a total of 24 rules in 0 ms. Remains 4 /16 variables (removed 12) and now considering 4/16 (removed 12) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 10:38:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/16 places, 4/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 4/16 places, 4/16 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s2 1), p1:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 Referendum-PT-0015-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLFireability-10 finished in 150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (complete) has 15 edges and 16 vertex of which 2 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 10:38:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 10:38:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/16 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 2/16 places, 2/16 transitions.
Stuttering acceptance computed with spot in 34 ms :[p0]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 78 ms.
Product exploration explored 100000 steps with 33333 reset in 80 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 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), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 212 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLFireability-11 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(p1))))'
Support contains 2 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (complete) has 15 edges and 16 vertex of which 3 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 13 output transitions
Drop transitions removed 13 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /16 variables (removed 13) and now considering 3/16 (removed 13) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 10:38:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-18 10:38:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:53] [INFO ] Invariant cache hit.
[2023-03-18 10:38:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/16 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 3/16 places, 3/16 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1), p1:(OR (EQ s2 1) (EQ s1 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25000 reset in 59 ms.
Product exploration explored 100000 steps with 25000 reset in 74 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 9 factoid took 290 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0015-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0015-LTLFireability-12 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2 transition count 2
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2 transition count 2
Applied a total of 28 rules in 1 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 10:38:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:38:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 10:38:54] [INFO ] Invariant cache hit.
[2023-03-18 10:38:54] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-18 10:38:54] [INFO ] Invariant cache hit.
[2023-03-18 10:38:54] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/16 places, 2/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 2/16 places, 2/16 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0015-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 0), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0015-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0015-LTLFireability-15 finished in 127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)||(p1&&F(p2))))||G(p1)))'
Found a Lengthening insensitive property : Referendum-PT-0015-LTLFireability-03
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1) (NOT p0)), true, (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-18 10:38:54] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:38:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 10:38:54] [INFO ] Invariant cache hit.
[2023-03-18 10:38:54] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-18 10:38:54] [INFO ] Invariant cache hit.
[2023-03-18 10:38:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 90 ms. Remains : 16/16 places, 16/16 transitions.
Running random walk in product with property : Referendum-PT-0015-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s0 1), p2:(AND (EQ s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0) (EQ s11 0) (EQ s12 0) (EQ s13 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24977 reset in 103 ms.
Product exploration explored 100000 steps with 25029 reset in 122 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 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 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (G (NOT p1))), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 913 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:56] [INFO ] Invariant cache hit.
[2023-03-18 10:38:56] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2) p0)))), (F (G (NOT p1))), (F (G p2)), (F (G p0)), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0)]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 867 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 1 out of 16 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 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:38:57] [INFO ] Invariant cache hit.
[2023-03-18 10:38:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 10:38:57] [INFO ] Invariant cache hit.
[2023-03-18 10:38:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 10:38:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:57] [INFO ] Invariant cache hit.
[2023-03-18 10:38:57] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 16/16 places, 16/16 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 365 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 588 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:38:57] [INFO ] Invariant cache hit.
[2023-03-18 10:38:57] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (G p0)), (F (G (NOT p1))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 472 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, false, (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, false, (NOT p0)]
Product exploration explored 100000 steps with 5882 reset in 105 ms.
Product exploration explored 100000 steps with 5882 reset in 97 ms.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (complete) has 15 edges and 16 vertex of which 1 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Applied a total of 1 rules in 0 ms. Remains 1 /16 variables (removed 15) and now considering 1/16 (removed 15) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 10:38:58] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:38:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 10:38:58] [INFO ] Invariant cache hit.
[2023-03-18 10:38:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 10:38:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 10:38:58] [INFO ] Invariant cache hit.
[2023-03-18 10:38:58] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/16 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 1/16 places, 1/16 transitions.
Treatment of property Referendum-PT-0015-LTLFireability-03 finished in 4410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||(F(p1)&&G(p2))))))'
Found a Lengthening insensitive property : Referendum-PT-0015-LTLFireability-04
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (AND p0 (NOT p2))]
Support contains 16 out of 16 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 16 cols
[2023-03-18 10:38:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:38:59] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-18 10:38:59] [INFO ] Invariant cache hit.
[2023-03-18 10:38:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 10:38:59] [INFO ] Invariant cache hit.
[2023-03-18 10:38:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 67 ms. Remains : 16/16 places, 16/16 transitions.
Running random walk in product with property : Referendum-PT-0015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 1), p2:(EQ s0 0), p1:(AND (EQ s1 0) (EQ s2 0) (EQ s3 0) (EQ s4 0) (EQ s5 0) (EQ s6 0) (EQ s7 0) (EQ s8 0) (EQ s9 0) (EQ s10 0) (EQ s11 0) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9809 reset in 102 ms.
Product exploration explored 100000 steps with 9696 reset in 105 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND (NOT p0) (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 632 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND (NOT p0) (NOT p1) p2)), (X (AND (NOT p0) p2)), (X (OR p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) p2))), (X (X (OR p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 16 factoid took 645 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p2), (NOT p2)]
[2023-03-18 10:39:01] [INFO ] Invariant cache hit.
[2023-03-18 10:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:39:01] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-18 10:39:01] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-18 10:39:01] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2023-03-18 10:39:01] [INFO ] Invariant cache hit.
[2023-03-18 10:39:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 10:39:01] [INFO ] Invariant cache hit.
[2023-03-18 10:39:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-18 10:39:01] [INFO ] Invariant cache hit.
[2023-03-18 10:39:01] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 16/16 places, 16/16 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 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 p2), (X p2), true, (X (X p2)), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (X p2), true, (X (X p2)), (F (G p2))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p2), (NOT p2)]
[2023-03-18 10:39:01] [INFO ] Invariant cache hit.
[2023-03-18 10:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 10:39:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-18 10:39:01] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 10:39:01] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 5882 reset in 86 ms.
Product exploration explored 100000 steps with 5882 reset in 91 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p2), (NOT p2)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Graph (complete) has 15 edges and 16 vertex of which 1 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions removed 15 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /16 variables (removed 15) and now considering 1/16 (removed 15) transitions.
[2023-03-18 10:39:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 10:39:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 10:39:02] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/16 places, 1/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23 ms. Remains : 1/16 places, 1/16 transitions.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 16/16 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 2 transition count 2
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 2 transition count 2
Applied a total of 28 rules in 1 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 10:39:02] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 10:39:02] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 10:39:02] [INFO ] Invariant cache hit.
[2023-03-18 10:39:02] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-18 10:39:02] [INFO ] Invariant cache hit.
[2023-03-18 10:39:02] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/16 places, 2/16 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 2/16 places, 2/16 transitions.
Treatment of property Referendum-PT-0015-LTLFireability-04 finished in 3405 ms.
[2023-03-18 10:39:02] [INFO ] Flatten gal took : 3 ms
[2023-03-18 10:39:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-18 10:39:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 16 places, 16 transitions and 31 arcs took 0 ms.
Total runtime 21104 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2050/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2050/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Referendum-PT-0015-LTLFireability-03
Could not compute solution for formula : Referendum-PT-0015-LTLFireability-04

BK_STOP 1679135943994

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Referendum-PT-0015-LTLFireability-03
ltl formula formula --ltl=/tmp/2050/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16 places, 16 transitions and 31 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2050/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2050/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2050/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2050/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name Referendum-PT-0015-LTLFireability-04
ltl formula formula --ltl=/tmp/2050/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 16 places, 16 transitions and 31 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2050/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2050/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2050/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2050/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
free(): double free detected in tcache 2
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
free(): double free detected in tcache 2

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="Referendum-PT-0015"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Referendum-PT-0015, 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 r329-tall-167889202100476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0015.tgz
mv Referendum-PT-0015 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 ;