Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 641K Apr 11 20:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.0M Apr 11 20:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 191K Apr 11 17:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 11 17:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 813K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 286K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 339K Apr 12 01:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.5M Apr 12 01:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 614K Apr 11 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.2M Apr 11 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 50K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 124K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 571K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716862197902

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0500
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:09:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:09:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:09:59] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-05-28 02:09:59] [INFO ] Transformed 1501 places.
[2024-05-28 02:09:59] [INFO ] Transformed 1001 transitions.
[2024-05-28 02:09:59] [INFO ] Found NUPN structural information;
[2024-05-28 02:09:59] [INFO ] Parsed PT model containing 1501 places and 1001 transitions and 2501 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Referendum-PT-0500-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 501 out of 1501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1501/1501 places, 1001/1001 transitions.
Reduce places removed 1000 places and 0 transitions.
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 500 transitions.
Iterating post reduction 0 with 1500 rules applied. Total rules applied 1500 place count 501 transition count 501
Applied a total of 1500 rules in 44 ms. Remains 501 /1501 variables (removed 1000) and now considering 501/1001 (removed 500) transitions.
// Phase 1: matrix 501 rows 501 cols
[2024-05-28 02:10:00] [INFO ] Computed 0 invariants in 16 ms
[2024-05-28 02:10:00] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-28 02:10:00] [INFO ] Invariant cache hit.
[2024-05-28 02:10:00] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2024-05-28 02:10:00] [INFO ] Invariant cache hit.
[2024-05-28 02:10:00] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 501/1501 places, 501/1001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 501/1501 places, 501/1001 transitions.
Support contains 501 out of 501 places after structural reductions.
[2024-05-28 02:10:01] [INFO ] Flatten gal took : 138 ms
[2024-05-28 02:10:01] [INFO ] Flatten gal took : 78 ms
[2024-05-28 02:10:01] [INFO ] Input system was already deterministic with 501 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 20) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-28 02:10:02] [INFO ] Invariant cache hit.
[2024-05-28 02:10:04] [INFO ] After 1371ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA Referendum-PT-0500-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0500-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||(F(p0)&&X(X(G(p1))))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 3 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-28 02:10:04] [INFO ] Invariant cache hit.
[2024-05-28 02:10:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 02:10:04] [INFO ] Invariant cache hit.
[2024-05-28 02:10:04] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-28 02:10:04] [INFO ] Invariant cache hit.
[2024-05-28 02:10:05] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 501/501 places, 501/501 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-01 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=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s0 0), p1:(AND (EQ s106 0) (EQ s171 0) (EQ s366 0) (EQ s431 0) (EQ s236 0) (EQ s301 0) (EQ s25 0) (EQ s496 0) (EQ s90 0) (EQ s155 0) (EQ s350 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 39977 reset in 3099 ms.
Product exploration explored 100000 steps with 40046 reset in 3125 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-01 finished in 7164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 3 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-28 02:10:11] [INFO ] Invariant cache hit.
[2024-05-28 02:10:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 02:10:11] [INFO ] Invariant cache hit.
[2024-05-28 02:10:11] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-05-28 02:10:11] [INFO ] Invariant cache hit.
[2024-05-28 02:10:12] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s0 0), p1:(AND (EQ s106 0) (EQ s171 0) (EQ s366 0) (EQ s431 0) (EQ s236 0) (EQ s301 0) (EQ s25 0) (EQ s496 0) (EQ s90 0) (EQ s155 0) (EQ s350 0) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 199 reset in 2106 ms.
Product exploration explored 100000 steps with 199 reset in 2281 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 177 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-02 finished in 5337 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p0))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 3 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-28 02:10:17] [INFO ] Invariant cache hit.
[2024-05-28 02:10:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 02:10:17] [INFO ] Invariant cache hit.
[2024-05-28 02:10:17] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-28 02:10:17] [INFO ] Invariant cache hit.
[2024-05-28 02:10:17] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}]], initial=1, aps=[p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 50000 reset in 3012 ms.
Product exploration explored 100000 steps with 50000 reset in 3127 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
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), true, (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-03 finished in 6981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 500 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 9 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-28 02:10:24] [INFO ] Invariant cache hit.
[2024-05-28 02:10:24] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 02:10:24] [INFO ] Invariant cache hit.
[2024-05-28 02:10:24] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-28 02:10:24] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-28 02:10:24] [INFO ] Invariant cache hit.
[2024-05-28 02:10:24] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ s415 1) (EQ s...], 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 3037 ms.
Product exploration explored 100000 steps with 50000 reset in 3149 ms.
Computed a total of 501 stabilizing places and 501 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 501 transition count 501
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-04 finished in 6951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 501 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Applied a total of 0 rules in 6 ms. Remains 501 /501 variables (removed 0) and now considering 501/501 (removed 0) transitions.
[2024-05-28 02:10:30] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 02:10:31] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-05-28 02:10:31] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 501/501 places, 501/501 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s0 1), p0:(OR (EQ s106 1) (EQ s171 1) (EQ s366 1) (EQ s431 1) (EQ s236 1) (EQ s301 1) (EQ s25 1) (EQ s496 1) (EQ s90 1) (EQ s155 1) (EQ s350 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-05 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Graph (complete) has 500 edges and 501 vertex of which 1 are kept as prefixes of interest. Removing 500 places using SCC suffix rule.3 ms
Discarding 500 places :
Also discarding 500 output transitions
Drop transitions removed 500 transitions
Applied a total of 1 rules in 8 ms. Remains 1 /501 variables (removed 500) and now considering 1/501 (removed 500) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-28 02:10:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:31] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:10:31] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-28 02:10:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:10:31] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1/501 places, 1/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 1/501 places, 1/501 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 77 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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-06 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U G((G(p2)||F((p0&&G(p1)))))))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 496 places :
Symmetric choice reduction at 0 with 496 rule applications. Total rules 496 place count 5 transition count 5
Iterating global reduction 0 with 496 rules applied. Total rules applied 992 place count 5 transition count 5
Applied a total of 992 rules in 19 ms. Remains 5 /501 variables (removed 496) and now considering 5/501 (removed 496) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 02:10:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:31] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 02:10:31] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-28 02:10:31] [INFO ] Invariant cache hit.
[2024-05-28 02:10:31] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/501 places, 5/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 5/501 places, 5/501 transitions.
Stuttering acceptance computed with spot in 620 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 9}, { cond=(AND p2 p0 p1), acceptance={} source=0 dest: 10}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0, 2} source=1 dest: 11}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 11}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 12}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 11}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 5}, { cond=(AND p2 p0 p1), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 2} source=5 dest: 7}, { cond=(AND p2 p0), acceptance={} source=5 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={1, 2} source=5 dest: 9}, { cond=(AND p2 p0 p1), acceptance={2} source=5 dest: 10}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=7 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=7 dest: 5}, { cond=(AND p2 p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p2 p0), acceptance={} source=7 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={1, 2} source=7 dest: 9}, { cond=(AND p2 p0 p1), acceptance={2} source=7 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=9 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 2} source=9 dest: 7}, { cond=(AND p2 p0), acceptance={} source=9 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={1, 2} source=9 dest: 9}, { cond=(AND p2 p0 p1), acceptance={2} source=9 dest: 10}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=10 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=10 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1, 2} source=10 dest: 5}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 2} source=10 dest: 7}, { cond=(AND p2 p0), acceptance={} source=10 dest: 8}, { cond=(AND p2 p0 (NOT p1)), acceptance={1, 2} source=10 dest: 9}, { cond=(AND p2 p0 p1), acceptance={2} source=10 dest: 10}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 11}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=11 dest: 1}, { cond=p1, acceptance={0, 2} source=11 dest: 11}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=12 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=12 dest: 11}, { cond=(AND p2 p1), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(EQ s3 1), p2:(NEQ s2 1), p1:(EQ s4 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-08 finished in 721 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X(X(p0))) U (p1&&X(p2)))&&F(G(p1)))))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 496 places :
Symmetric choice reduction at 0 with 496 rule applications. Total rules 496 place count 5 transition count 5
Iterating global reduction 0 with 496 rules applied. Total rules applied 992 place count 5 transition count 5
Applied a total of 992 rules in 13 ms. Remains 5 /501 variables (removed 496) and now considering 5/501 (removed 496) transitions.
[2024-05-28 02:10:32] [INFO ] Invariant cache hit.
[2024-05-28 02:10:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:10:32] [INFO ] Invariant cache hit.
[2024-05-28 02:10:32] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:10:32] [INFO ] Invariant cache hit.
[2024-05-28 02:10:32] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/501 places, 5/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 5/501 places, 5/501 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(EQ s3 1), p2:(EQ s4 1), p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 501 steps with 0 reset in 1 ms.
FORMULA Referendum-PT-0500-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-09 finished in 458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(G(p1)||(p1&&G(F(p2))))))))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 10 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:10:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s0 1), p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-10 finished in 231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X((G((p1||X(X(G(!p2))))) U (p0&&G((p1||X(X(G(!p2))))))))))))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 497 places :
Symmetric choice reduction at 0 with 497 rule applications. Total rules 497 place count 4 transition count 4
Iterating global reduction 0 with 497 rules applied. Total rules applied 994 place count 4 transition count 4
Applied a total of 994 rules in 11 ms. Remains 4 /501 variables (removed 497) and now considering 4/501 (removed 497) transitions.
// Phase 1: matrix 4 rows 4 cols
[2024-05-28 02:10:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 4/501 places, 4/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 4/501 places, 4/501 transitions.
Stuttering acceptance computed with spot in 312 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p0) (AND (NOT p1) p2)), p2, (AND p2 (NOT p1)), p2, true]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 6}, { cond=p2, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s2 1), p1:(NEQ s3 1), p2:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1012 steps with 4 reset in 2 ms.
FORMULA Referendum-PT-0500-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-12 finished in 417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 496 places :
Symmetric choice reduction at 0 with 496 rule applications. Total rules 496 place count 5 transition count 5
Iterating global reduction 0 with 496 rules applied. Total rules applied 992 place count 5 transition count 5
Applied a total of 992 rules in 9 ms. Remains 5 /501 variables (removed 496) and now considering 5/501 (removed 496) transitions.
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 02:10:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [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.
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/501 places, 5/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 5/501 places, 5/501 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s4 1) (OR (EQ s3 1) (EQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-13 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U p1) U !p0))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Graph (complete) has 500 edges and 501 vertex of which 3 are kept as prefixes of interest. Removing 498 places using SCC suffix rule.2 ms
Discarding 498 places :
Also discarding 498 output transitions
Drop transitions removed 498 transitions
Applied a total of 1 rules in 4 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:10:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:10:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:10:33] [INFO ] Invariant cache hit.
[2024-05-28 02:10:33] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s1 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0500-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0500-LTLFireability-14 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(!p1))))'
Support contains 2 out of 501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 501/501 places, 501/501 transitions.
Discarding 498 places :
Symmetric choice reduction at 0 with 498 rule applications. Total rules 498 place count 3 transition count 3
Iterating global reduction 0 with 498 rules applied. Total rules applied 996 place count 3 transition count 3
Applied a total of 996 rules in 12 ms. Remains 3 /501 variables (removed 498) and now considering 3/501 (removed 498) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-28 02:10:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-28 02:10:34] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:10:34] [INFO ] Invariant cache hit.
[2024-05-28 02:10:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-28 02:10:34] [INFO ] Invariant cache hit.
[2024-05-28 02:10:34] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/501 places, 3/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 3/501 places, 3/501 transitions.
Stuttering acceptance computed with spot in 244 ms :[p1, p1, p1, p1, true, p1, (NOT p0)]
Running random walk in product with property : Referendum-PT-0500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s0 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 62 ms.
Product exploration explored 100000 steps with 33333 reset in 67 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-PT-0500-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-PT-0500-LTLFireability-15 finished in 512 ms.
All properties solved by simple procedures.
Total runtime 35214 ms.

BK_STOP 1716862235826

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is Referendum-PT-0500, 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-171662362200393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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