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-167889202100492.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-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-167889202100492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 68K Feb 26 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 370K Feb 26 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Feb 26 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 210K Feb 26 17:30 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 32K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 121K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 105K Feb 26 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 563K Feb 26 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104K Feb 26 17:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 823K Feb 26 17:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 12K 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 57K 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-0050-LTLFireability-00
FORMULA_NAME Referendum-PT-0050-LTLFireability-01
FORMULA_NAME Referendum-PT-0050-LTLFireability-02
FORMULA_NAME Referendum-PT-0050-LTLFireability-03
FORMULA_NAME Referendum-PT-0050-LTLFireability-04
FORMULA_NAME Referendum-PT-0050-LTLFireability-05
FORMULA_NAME Referendum-PT-0050-LTLFireability-06
FORMULA_NAME Referendum-PT-0050-LTLFireability-07
FORMULA_NAME Referendum-PT-0050-LTLFireability-08
FORMULA_NAME Referendum-PT-0050-LTLFireability-09
FORMULA_NAME Referendum-PT-0050-LTLFireability-10
FORMULA_NAME Referendum-PT-0050-LTLFireability-11
FORMULA_NAME Referendum-PT-0050-LTLFireability-12
FORMULA_NAME Referendum-PT-0050-LTLFireability-13
FORMULA_NAME Referendum-PT-0050-LTLFireability-14
FORMULA_NAME Referendum-PT-0050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679137205055

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-0050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 11:00:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 11:00:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 11:00:06] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-18 11:00:06] [INFO ] Transformed 151 places.
[2023-03-18 11:00:06] [INFO ] Transformed 101 transitions.
[2023-03-18 11:00:06] [INFO ] Found NUPN structural information;
[2023-03-18 11:00:06] [INFO ] Parsed PT model containing 151 places and 101 transitions and 251 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-PT-0050-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0050-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 101/101 transitions.
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 51 transition count 51
Applied a total of 150 rules in 16 ms. Remains 51 /151 variables (removed 100) and now considering 51/101 (removed 50) transitions.
// Phase 1: matrix 51 rows 51 cols
[2023-03-18 11:00:07] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-18 11:00:07] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-18 11:00:07] [INFO ] Invariant cache hit.
[2023-03-18 11:00:07] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-18 11:00:07] [INFO ] Invariant cache hit.
[2023-03-18 11:00:07] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/151 places, 51/101 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 51/151 places, 51/101 transitions.
Support contains 51 out of 51 places after structural reductions.
[2023-03-18 11:00:07] [INFO ] Flatten gal took : 27 ms
[2023-03-18 11:00:07] [INFO ] Flatten gal took : 10 ms
[2023-03-18 11:00:07] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 11:00:07] [INFO ] Invariant cache hit.
[2023-03-18 11:00:07] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-18 11:00:08] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA Referendum-PT-0050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
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)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 2 transition count 2
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 2 transition count 2
Applied a total of 98 rules in 3 ms. Remains 2 /51 variables (removed 49) and now considering 2/51 (removed 49) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 11:00:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:08] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 11:00:08] [INFO ] Invariant cache hit.
[2023-03-18 11:00:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-18 11:00:08] [INFO ] Invariant cache hit.
[2023-03-18 11:00:08] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/51 places, 2/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 324 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 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]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 4 ms.
FORMULA Referendum-PT-0050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-00 finished in 442 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(G((X(p2)&&p1)))))'
Support contains 50 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2023-03-18 11:00:08] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 11:00:08] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 11:00:08] [INFO ] Invariant cache hit.
[2023-03-18 11:00:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-18 11:00:08] [INFO ] Invariant cache hit.
[2023-03-18 11:00:08] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2))]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(AND (EQ s31 0) (EQ s29 0) (EQ s35 0) (EQ s33 0) (EQ s39 0) (EQ s37 0) (EQ s43 0) (EQ s41 0) (EQ s47 0) (EQ s45 0) (EQ s49 0) (EQ s2 0) (EQ s6 0) (EQ s...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-02 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F(p1)&&X(X(p2)))||X(X(G(p2))))))'
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:09] [INFO ] Invariant cache hit.
[2023-03-18 11:00:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 11:00:09] [INFO ] Invariant cache hit.
[2023-03-18 11:00:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-18 11:00:09] [INFO ] Invariant cache hit.
[2023-03-18 11:00:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s31 0) (EQ s29 0) (EQ s35 0) (EQ s33 0) (EQ s39 0) (EQ s37 0) (EQ s43 0) (EQ s41 0) (EQ s47 0) (EQ s45 0) (EQ s49 0) (EQ s2 0) (EQ s6 0) (EQ s...], 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 1923 reset in 468 ms.
Product exploration explored 100000 steps with 1923 reset in 299 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
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 p1 p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G p0)), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 8 factoid took 250 ms. Reduced automaton from 8 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-03 finished in 1597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 2 transition count 2
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 2 transition count 2
Applied a total of 98 rules in 2 ms. Remains 2 /51 variables (removed 49) and now considering 2/51 (removed 49) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 11:00:10] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 11:00:10] [INFO ] Invariant cache hit.
[2023-03-18 11:00:10] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 11:00:10] [INFO ] Invariant cache hit.
[2023-03-18 11:00:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/51 places, 2/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, p0, p0]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s0 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]]
Product exploration explored 100000 steps with 1923 reset in 143 ms.
Product exploration explored 100000 steps with 1923 reset in 96 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 : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 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 79 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 262 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 81 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 97 ms :[true, p0, p0]
[2023-03-18 11:00:11] [INFO ] Invariant cache hit.
[2023-03-18 11:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 11:00:11] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 11:00:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 11:00:11] [INFO ] Invariant cache hit.
[2023-03-18 11:00:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 11:00:12] [INFO ] Invariant cache hit.
[2023-03-18 11:00:12] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 11:00:12] [INFO ] Invariant cache hit.
[2023-03-18 11:00:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 2/2 places, 2/2 transitions.
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 : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 208 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, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 196 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 68 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 110 ms :[true, p0, p0]
[2023-03-18 11:00:12] [INFO ] Invariant cache hit.
[2023-03-18 11:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 11:00:12] [INFO ] Computed and/alt/rep : 1/1/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 11:00:12] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 83 ms :[true, p0, p0]
Product exploration explored 100000 steps with 1923 reset in 66 ms.
Product exploration explored 100000 steps with 1923 reset in 44 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 4 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
[2023-03-18 11:00:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 11:00:13] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 11:00:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27 ms. Remains : 1/2 places, 1/2 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 11:00:13] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 11:00:13] [INFO ] Invariant cache hit.
[2023-03-18 11:00:13] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 11:00:13] [INFO ] Invariant cache hit.
[2023-03-18 11:00:13] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Referendum-PT-0050-LTLFireability-04 finished in 2529 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(X(!(!p0 U X(p1))))||X(!p0))))'
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2023-03-18 11:00:13] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 11:00:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-18 11:00:13] [INFO ] Invariant cache hit.
[2023-03-18 11:00:13] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 11:00:13] [INFO ] Invariant cache hit.
[2023-03-18 11:00:13] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s0 1), p0:(AND (NEQ s31 1) (NEQ s29 1) (NEQ s35 1) (NEQ s33 1) (NEQ s39 1) (NEQ s37 1) (NEQ s43 1) (NEQ s41 1) (NEQ s47 1) (NEQ s45 1) (NEQ s49 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1923 reset in 344 ms.
Product exploration explored 100000 steps with 1923 reset in 300 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 243 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 274 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 170 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
[2023-03-18 11:00:15] [INFO ] Invariant cache hit.
[2023-03-18 11:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-18 11:00:15] [INFO ] Computed and/alt/rep : 50/50/50 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 11:00:15] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG (AND p1 p0)
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:15] [INFO ] Invariant cache hit.
[2023-03-18 11:00:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 11:00:15] [INFO ] Invariant cache hit.
[2023-03-18 11:00:15] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-18 11:00:15] [INFO ] Invariant cache hit.
[2023-03-18 11:00:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 51/51 places, 51/51 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 238 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 280 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 163 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
[2023-03-18 11:00:16] [INFO ] Invariant cache hit.
[2023-03-18 11:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:16] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-18 11:00:16] [INFO ] Computed and/alt/rep : 50/50/50 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-18 11:00:16] [INFO ] Added : 0 causal constraints over 0 iterations in 28 ms. Result :sat
Could not prove EG (AND p1 p0)
Stuttering acceptance computed with spot in 153 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1923 reset in 252 ms.
Product exploration explored 100000 steps with 1923 reset in 275 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:17] [INFO ] Invariant cache hit.
[2023-03-18 11:00:17] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 51/51 places, 51/51 transitions.
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:17] [INFO ] Invariant cache hit.
[2023-03-18 11:00:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 11:00:17] [INFO ] Invariant cache hit.
[2023-03-18 11:00:17] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-18 11:00:17] [INFO ] Invariant cache hit.
[2023-03-18 11:00:17] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 51/51 places, 51/51 transitions.
Treatment of property Referendum-PT-0050-LTLFireability-05 finished in 4672 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(!p1)||p0)))'
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:18] [INFO ] Invariant cache hit.
[2023-03-18 11:00:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-18 11:00:18] [INFO ] Invariant cache hit.
[2023-03-18 11:00:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2023-03-18 11:00:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:18] [INFO ] Invariant cache hit.
[2023-03-18 11:00:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (NEQ s31 1) (NEQ s29 1) (NEQ s35 1) (NEQ s33 1) (NEQ s39 1) (NEQ s37 1) (NEQ s43 1) (NEQ s41 1) (NEQ s47 1) (NEQ s45 1) (NEQ s49 1) (NEQ s2 1) (NE...], 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 50000 reset in 412 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0050-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-06 finished in 1342 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 50 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:19] [INFO ] Invariant cache hit.
[2023-03-18 11:00:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 11:00:19] [INFO ] Invariant cache hit.
[2023-03-18 11:00:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-18 11:00:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:19] [INFO ] Invariant cache hit.
[2023-03-18 11:00:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 103 ms. Remains : 51/51 places, 51/51 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s31 1) (NEQ s29 1) (NEQ s35 1) (NEQ s33 1) (NEQ s39 1) (NEQ s37 1) (NEQ s43 1) (NEQ s41 1) (NEQ s47 1) (NEQ s45 1) (NEQ s49 1) (NEQ s2 1) (NE...], 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 286 ms.
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 4 factoid took 75 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-0050-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-07 finished in 843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 2 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.1 ms
Discarding 49 places :
Also discarding 49 output transitions
Drop transitions removed 49 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /51 variables (removed 49) and now considering 2/51 (removed 49) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 11:00:20] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 11:00:20] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 11:00:20] [INFO ] Invariant cache hit.
[2023-03-18 11:00:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-18 11:00:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:20] [INFO ] Invariant cache hit.
[2023-03-18 11:00:20] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 2/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-08 finished in 153 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)||(!p0&&F(G(p0))))))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 2 transition count 2
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 2 transition count 2
Applied a total of 98 rules in 2 ms. Remains 2 /51 variables (removed 49) and now considering 2/51 (removed 49) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 11:00:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:20] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-18 11:00:20] [INFO ] Invariant cache hit.
[2023-03-18 11:00:20] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-18 11:00:20] [INFO ] Invariant cache hit.
[2023-03-18 11:00:20] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/51 places, 2/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 2/51 places, 2/51 transitions.
Stuttering acceptance computed with spot in 146 ms :[p0, p0, true, false, (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1923 reset in 126 ms.
Product exploration explored 100000 steps with 1923 reset in 168 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 : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 5 states, 8 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[false, false, false, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[false, false, false, (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[false, false, false, (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-18 11:00:21] [INFO ] Invariant cache hit.
[2023-03-18 11:00:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 11:00:21] [INFO ] Invariant cache hit.
[2023-03-18 11:00:21] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 11:00:21] [INFO ] Invariant cache hit.
[2023-03-18 11:00:21] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 2/2 places, 2/2 transitions.
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 : [p0, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[false, false, false, (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 4 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[false, false, false, (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[false, false, false, (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[false, false, false, (NOT p0)]
Product exploration explored 100000 steps with 1923 reset in 36 ms.
Product exploration explored 100000 steps with 1923 reset in 40 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 159 ms :[false, false, false, (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Graph (complete) has 1 edges and 2 vertex of which 1 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 1 /2 variables (removed 1) and now considering 1/2 (removed 1) transitions.
[2023-03-18 11:00:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 11:00:22] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:22] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/2 places, 1/2 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27 ms. Remains : 1/2 places, 1/2 transitions.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 11:00:22] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:22] [INFO ] Implicit Places using invariants in 12 ms returned []
[2023-03-18 11:00:22] [INFO ] Invariant cache hit.
[2023-03-18 11:00:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-18 11:00:22] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Referendum-PT-0050-LTLFireability-09 finished in 2700 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&&(G(F(p1))||(p1&&F(p2))))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 3 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.0 ms
Discarding 48 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 11:00:23] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [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 11:00:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [INFO ] Dead Transitions using invariants and state equation in 13 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/51 places, 3/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-11 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=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s2 1), p2:(EQ s1 0)], nbAcceptance=1, 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 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-11 finished in 264 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) U p1)&&(X(p1) U p2)&&p3)))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 5 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.0 ms
Discarding 46 places :
Also discarding 46 output transitions
Drop transitions removed 46 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /51 variables (removed 46) and now considering 5/51 (removed 46) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-18 11:00:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 11:00:23] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 11:00:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/51 places, 5/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 5/51 places, 5/51 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p3) (NOT p1) (NOT p2)), (OR (AND p0 (NOT p3)) (AND p0 (NOT p1)) (AND p0 (NOT p2))), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p3) (AND (NOT p1) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=0 dest: 2}, { cond=(OR (AND p3 p1 (NOT p2)) (AND p3 (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={} source=1 dest: 1}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p3 (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s4 1), p1:(EQ s0 1), p0:(AND (EQ s1 1) (EQ s3 1)), p2:(EQ s2 1)], nbAcceptance=1, 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 5 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-12 finished in 318 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((p0 U X(X(p1))))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 4 transition count 4
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 4 transition count 4
Applied a total of 94 rules in 3 ms. Remains 4 /51 variables (removed 47) and now considering 4/51 (removed 47) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-18 11:00:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 11:00:23] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-18 11:00:23] [INFO ] Invariant cache hit.
[2023-03-18 11:00:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/51 places, 4/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 4/51 places, 4/51 transitions.
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={} source=8 dest: 6}]], initial=8, aps=[p1:(EQ s3 1), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0050-LTLFireability-14 finished in 354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 3 transition count 3
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 3 transition count 3
Applied a total of 96 rules in 3 ms. Remains 3 /51 variables (removed 48) and now considering 3/51 (removed 48) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 11:00:23] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 11:00:24] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 11:00:24] [INFO ] Invariant cache hit.
[2023-03-18 11:00:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-18 11:00:24] [INFO ] Invariant cache hit.
[2023-03-18 11:00:24] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/51 places, 3/51 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 3/51 places, 3/51 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 45 ms.
Product exploration explored 100000 steps with 50000 reset in 50 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 : [(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 :(X p0)
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0050-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0050-LTLFireability-15 finished in 447 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)))'
Found a Lengthening insensitive property : Referendum-PT-0050-LTLFireability-04
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Graph (complete) has 50 edges and 51 vertex of which 1 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.0 ms
Discarding 50 places :
Also discarding 50 output transitions
Drop transitions removed 50 transitions
Applied a total of 1 rules in 1 ms. Remains 1 /51 variables (removed 50) and now considering 1/51 (removed 50) transitions.
// Phase 1: matrix 1 rows 1 cols
[2023-03-18 11:00:24] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 11:00:24] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-18 11:00:24] [INFO ] Invariant cache hit.
[2023-03-18 11:00:24] [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 11:00:24] [INFO ] Invariant cache hit.
[2023-03-18 11:00:24] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 1/51 places, 1/51 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 49 ms. Remains : 1/51 places, 1/51 transitions.
Running random walk in product with property : Referendum-PT-0050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s0 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, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 36 ms.
Product exploration explored 100000 steps with 50000 reset in 40 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 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 75 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 210 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 70 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 69 ms :[true, p0, p0]
[2023-03-18 11:00:25] [INFO ] Invariant cache hit.
[2023-03-18 11:00:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:25] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-18 11:00:25] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 11:00:25] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 11:00:25] [INFO ] Invariant cache hit.
[2023-03-18 11:00:25] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-18 11:00:25] [INFO ] Invariant cache hit.
[2023-03-18 11:00:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-18 11:00:25] [INFO ] Invariant cache hit.
[2023-03-18 11:00:25] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 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 94 ms :[true, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 5 factoid took 211 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 75 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 73 ms :[true, p0, p0]
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-18 11:00:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-18 11:00:26] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 89 ms :[true, p0, p0]
Product exploration explored 100000 steps with 50000 reset in 34 ms.
Product exploration explored 100000 steps with 50000 reset in 38 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 72 ms :[true, p0, p0]
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 7 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 11:00:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 1/1 places, 1/1 transitions.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Referendum-PT-0050-LTLFireability-04 finished in 2104 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(X(!(!p0 U X(p1))))||X(!p0))))'
Found a Lengthening insensitive property : Referendum-PT-0050-LTLFireability-05
Stuttering acceptance computed with spot in 164 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 51 cols
[2023-03-18 11:00:26] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-18 11:00:26] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-18 11:00:26] [INFO ] Invariant cache hit.
[2023-03-18 11:00:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 105 ms. Remains : 51/51 places, 51/51 transitions.
Running random walk in product with property : Referendum-PT-0050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=3, aps=[p1:(EQ s0 1), p0:(AND (NEQ s31 1) (NEQ s29 1) (NEQ s35 1) (NEQ s33 1) (NEQ s39 1) (NEQ s37 1) (NEQ s43 1) (NEQ s41 1) (NEQ s47 1) (NEQ s45 1) (NEQ s49 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1923 reset in 253 ms.
Product exploration explored 100000 steps with 1923 reset in 259 ms.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 166 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
[2023-03-18 11:00:28] [INFO ] Invariant cache hit.
[2023-03-18 11:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-18 11:00:28] [INFO ] Computed and/alt/rep : 50/50/50 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-18 11:00:28] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (AND p1 p0)
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:28] [INFO ] Invariant cache hit.
[2023-03-18 11:00:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 11:00:28] [INFO ] Invariant cache hit.
[2023-03-18 11:00:28] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-18 11:00:28] [INFO ] Invariant cache hit.
[2023-03-18 11:00:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 51/51 places, 51/51 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 51
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 199 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 166 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
[2023-03-18 11:00:29] [INFO ] Invariant cache hit.
[2023-03-18 11:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 11:00:29] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-18 11:00:29] [INFO ] Computed and/alt/rep : 50/50/50 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-18 11:00:29] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Could not prove EG (AND p1 p0)
Stuttering acceptance computed with spot in 149 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 1923 reset in 246 ms.
Product exploration explored 100000 steps with 1923 reset in 260 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[true, p1, p1, (AND p1 p0), (AND p1 p0)]
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 11:00:30] [INFO ] Invariant cache hit.
[2023-03-18 11:00:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 51/51 places, 51/51 transitions.
Support contains 51 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-18 11:00:30] [INFO ] Invariant cache hit.
[2023-03-18 11:00:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 11:00:30] [INFO ] Invariant cache hit.
[2023-03-18 11:00:30] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-18 11:00:30] [INFO ] Invariant cache hit.
[2023-03-18 11:00:31] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 51/51 places, 51/51 transitions.
Treatment of property Referendum-PT-0050-LTLFireability-05 finished in 4490 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)||(!p0&&F(G(p0))))))'
[2023-03-18 11:00:31] [INFO ] Flatten gal took : 6 ms
[2023-03-18 11:00:31] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-18 11:00:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 51 places, 51 transitions and 101 arcs took 0 ms.
Total runtime 24580 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2125/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2125/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 1190 seconds
MemTotal: 16393216 kB
MemFree: 6824144 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16123832 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2125/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Referendum-PT-0050-LTLFireability-04
Could not compute solution for formula : Referendum-PT-0050-LTLFireability-05
Could not compute solution for formula : Referendum-PT-0050-LTLFireability-09

BK_STOP 1679138423609

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Referendum-PT-0050-LTLFireability-04
ltl formula formula --ltl=/tmp/2125/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 51 places, 51 transitions and 101 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2125/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2125/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2125/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2125/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55e9ac91e3f4]
1: pnml2lts-mc(+0xa2496) [0x55e9ac91e496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f7ec94fd140]
3: pnml2lts-mc(+0x405be5) [0x55e9acc81be5]
4: pnml2lts-mc(+0x16b3f9) [0x55e9ac9e73f9]
5: pnml2lts-mc(+0x164ac4) [0x55e9ac9e0ac4]
6: pnml2lts-mc(+0x272e0a) [0x55e9acaeee0a]
7: pnml2lts-mc(+0xb61f0) [0x55e9ac9321f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f7ec93504d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f7ec935067a]
10: pnml2lts-mc(+0xa1581) [0x55e9ac91d581]
11: pnml2lts-mc(+0xa1910) [0x55e9ac91d910]
12: pnml2lts-mc(+0xa32a2) [0x55e9ac91f2a2]
13: pnml2lts-mc(+0xa50f4) [0x55e9ac9210f4]
14: pnml2lts-mc(+0xa516b) [0x55e9ac92116b]
15: pnml2lts-mc(+0x3f34b3) [0x55e9acc6f4b3]
16: pnml2lts-mc(+0x7c63d) [0x55e9ac8f863d]
17: pnml2lts-mc(+0x67d86) [0x55e9ac8e3d86]
18: pnml2lts-mc(+0x60a8a) [0x55e9ac8dca8a]
19: pnml2lts-mc(+0x5eb15) [0x55e9ac8dab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f7ec9338d0a]
21: pnml2lts-mc(+0x6075e) [0x55e9ac8dc75e]
ltl formula name Referendum-PT-0050-LTLFireability-05
ltl formula formula --ltl=/tmp/2125/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 51 places, 51 transitions and 101 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( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2125/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2125/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2125/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2125/ltl_1_
Killing (15) : 2137 2138 2139 2140 2141
Killing (9) : 2137 2138 2139 2140 2141
ltl formula name Referendum-PT-0050-LTLFireability-09
ltl formula formula --ltl=/tmp/2125/ltl_2_
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 51 places, 51 transitions and 101 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2125/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2125/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2125/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2125/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x555dc88413f4]
1: pnml2lts-mc(+0xa2496) [0x555dc8841496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f94047d2140]
3: pnml2lts-mc(+0x405be5) [0x555dc8ba4be5]
4: pnml2lts-mc(+0x16b3f9) [0x555dc890a3f9]
5: pnml2lts-mc(+0x164ac4) [0x555dc8903ac4]
6: pnml2lts-mc(+0x272e0a) [0x555dc8a11e0a]
7: pnml2lts-mc(+0xb61f0) [0x555dc88551f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f94046254d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f940462567a]
10: pnml2lts-mc(+0xa1581) [0x555dc8840581]
11: pnml2lts-mc(+0xa1910) [0x555dc8840910]
12: pnml2lts-mc(+0xa32a2) [0x555dc88422a2]
13: pnml2lts-mc(+0xa50f4) [0x555dc88440f4]
14: pnml2lts-mc(+0xa516b) [0x555dc884416b]
15: pnml2lts-mc(+0x3f34b3) [0x555dc8b924b3]
16: pnml2lts-mc(+0x7c63d) [0x555dc881b63d]
17: pnml2lts-mc(+0x67d86) [0x555dc8806d86]
18: pnml2lts-mc(+0x60a8a) [0x555dc87ffa8a]
19: pnml2lts-mc(+0x5eb15) [0x555dc87fdb15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f940460dd0a]
21: pnml2lts-mc(+0x6075e) [0x555dc87ff75e]

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

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