Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415900533.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-PT-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415900533
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 51K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 282K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 23K May 5 16:51 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-0020-00
FORMULA_NAME Referendum-PT-0020-01
FORMULA_NAME Referendum-PT-0020-02
FORMULA_NAME Referendum-PT-0020-03
FORMULA_NAME Referendum-PT-0020-04
FORMULA_NAME Referendum-PT-0020-05
FORMULA_NAME Referendum-PT-0020-06
FORMULA_NAME Referendum-PT-0020-07
FORMULA_NAME Referendum-PT-0020-08
FORMULA_NAME Referendum-PT-0020-09
FORMULA_NAME Referendum-PT-0020-10
FORMULA_NAME Referendum-PT-0020-11
FORMULA_NAME Referendum-PT-0020-12
FORMULA_NAME Referendum-PT-0020-13
FORMULA_NAME Referendum-PT-0020-14
FORMULA_NAME Referendum-PT-0020-15

=== Now, execution of the tool begins

BK_START 1621260572927

Running Version 0
[2021-05-17 14:09:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:09:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:09:34] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2021-05-17 14:09:34] [INFO ] Transformed 61 places.
[2021-05-17 14:09:34] [INFO ] Transformed 41 transitions.
[2021-05-17 14:09:34] [INFO ] Found NUPN structural information;
[2021-05-17 14:09:34] [INFO ] Parsed PT model containing 61 places and 41 transitions in 69 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:09:34] [INFO ] Initial state test concluded for 1 properties.
FORMULA Referendum-PT-0020-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 61 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 61/61 places, 41/41 transitions.
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 21 transition count 21
Applied a total of 60 rules in 11 ms. Remains 21 /61 variables (removed 40) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:34] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:09:34] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:34] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/61 places, 21/41 transitions.
[2021-05-17 14:09:35] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 14:09:35] [INFO ] Flatten gal took : 16 ms
FORMULA Referendum-PT-0020-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0020-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:09:35] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:09:35] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 15 properties in 1 ms. (steps per millisecond=2 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-PT-0020-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1)), p1:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA Referendum-PT-0020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-00 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X((p1||X(p2))))&&p0)))], workingDir=/home/mcc/execution]
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : Referendum-PT-0020-01 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s1 0) (EQ s3 0) (EQ s2 0) (EQ s5 0) (EQ s4 0) (EQ s7 0) (EQ s6 0) (EQ s9 0) (EQ s8 0) (EQ s11 0) (EQ s10 0) (EQ s13 0) (EQ s12 0) (EQ s15 0) (EQ s14 0) (EQ s17 0) (EQ s16 0) (EQ s19 0) (EQ s18 0) (EQ s20 0)), p1:(EQ s0 1), p2:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 0 ms.
FORMULA Referendum-PT-0020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-01 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X(p1)))], workingDir=/home/mcc/execution]
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 14:09:35] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:35] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:35] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1)), p1:(EQ s0 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 : [(F (G (NOT p0))), (F (G p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 21 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-17 14:09:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:37] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
[2021-05-17 14:09:37] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:09:37] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:09:37] [INFO ] Time to serialize gal into /tmp/LTL16588309260289556733.gal : 1 ms
[2021-05-17 14:09:37] [INFO ] Time to serialize properties into /tmp/LTL751060211906438135.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16588309260289556733.gal, -t, CGAL, -LTL, /tmp/LTL751060211906438135.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16588309260289556733.gal -t CGAL -LTL /tmp/LTL751060211906438135.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))"))||(X("(ready==0)"))))
Formula 0 simplified : !(F"((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))" | X"(ready==0)")
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/20/21
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.037624,16656,1,0,72,1298,65,26,576,863,54
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0020-02 finished in 1783 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0||G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 8 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:37] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:37] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-17 14:09:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:37] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Referendum-PT-0020-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s0 1), p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4545 reset in 191 ms.
Product exploration explored 100000 steps with 4545 reset in 176 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 : [(F (G (NOT p1))), (F (G (NOT p0))), p1, (NOT p0)]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
FORMULA Referendum-PT-0020-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0020-03 finished in 596 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(((G((p2 U X(p3)))||p1) U p2))||p0)))], workingDir=/home/mcc/execution]
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:38] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:38] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:38] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:38] [INFO ] Computed 0 place invariants in 9 ms
[2021-05-17 14:09:38] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p3), (NOT p3), true, (NOT p3)]
Running random walk in product with property : Referendum-PT-0020-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1)), p2:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1)), p1:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1)), p3:(EQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 : [(F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p3))), (NOT p0), (NOT p2), (NOT p1), p3]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p3), (NOT p3), true, (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Applying partial POR strategy [false, false, false, true, false, true, false]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p3), (NOT p3), true, (NOT p3)]
Support contains 21 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-17 14:09:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:40] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Product exploration explored 100000 steps with 50000 reset in 114 ms.
[2021-05-17 14:09:40] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:09:40] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:09:40] [INFO ] Time to serialize gal into /tmp/LTL12449978909754436058.gal : 1 ms
[2021-05-17 14:09:40] [INFO ] Time to serialize properties into /tmp/LTL2422066337916284130.ltl : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12449978909754436058.gal, -t, CGAL, -LTL, /tmp/LTL2422066337916284130.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12449978909754436058.gal -t CGAL -LTL /tmp/LTL2422066337916284130.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))")||(X((("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))")||(G(("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))")U(X("(ready==1)")))))U("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))"))))))
Formula 0 simplified : !X("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))" | X(("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))" | G("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))" U X"(ready==1)")) U "((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/20/21
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.04084,17064,1,0,72,1298,60,26,570,863,52
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0020-04 finished in 2356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 6 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:40] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:40] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 14:09:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:40] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Referendum-PT-0020-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-05 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 20 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:40] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:40] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:40] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:40] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-PT-0020-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1 1) (EQ s3 1) (EQ s2 1) (EQ s5 1) (EQ s4 1) (EQ s7 1) (EQ s6 1) (EQ s9 1) (EQ s8 1) (EQ s11 1) (EQ s10 1) (EQ s13 1) (EQ s12 1) (EQ s15 1) (EQ s14 1) (EQ s17 1) (EQ s16 1) (EQ s19 1) (EQ s18 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 21
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 : [(F (G (NOT p0))), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Support contains 20 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-17 14:09:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 14:09:41] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:41] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
[2021-05-17 14:09:41] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:09:41] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:09:41] [INFO ] Time to serialize gal into /tmp/LTL10808120628534740480.gal : 1 ms
[2021-05-17 14:09:41] [INFO ] Time to serialize properties into /tmp/LTL884040757702745255.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL10808120628534740480.gal, -t, CGAL, -LTL, /tmp/LTL884040757702745255.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL10808120628534740480.gal -t CGAL -LTL /tmp/LTL884040757702745255.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))"))))
Formula 0 simplified : !XF"((((((((((((((((((((voting_1==1)||(voting_3==1))||(voting_2==1))||(voting_5==1))||(voting_4==1))||(voting_7==1))||(voting_6==1))||(voting_9==1))||(voting_8==1))||(voting_11==1))||(voting_10==1))||(voting_13==1))||(voting_12==1))||(voting_15==1))||(voting_14==1))||(voting_17==1))||(voting_16==1))||(voting_19==1))||(voting_18==1))||(voting_20==1))"
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/20/21
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.019314,16292,1,0,72,1298,66,26,557,863,54
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0020-07 finished in 1282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U (p1||X((G(p2) U (p1&&G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5 transition count 5
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5 transition count 5
Applied a total of 32 rules in 3 ms. Remains 5 /21 variables (removed 16) and now considering 5/21 (removed 16) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:41] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:41] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:41] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:41] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:09:41] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:41] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/21 places, 5/21 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p1), true, (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Referendum-PT-0020-09 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(NEQ s3 1), p1:(EQ s2 0), p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 3 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-09 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 5 transition count 5
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 5 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 4 transition count 4
Applied a total of 34 rules in 3 ms. Remains 4 /21 variables (removed 17) and now considering 4/21 (removed 17) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:42] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 14:09:42] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 14:09:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:42] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/21 places, 4/21 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : Referendum-PT-0020-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s2 1), p1:(NEQ s3 1), p2:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Referendum-PT-0020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-PT-0020-10 finished in 199 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(p0)||X((F(p1) U p2))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 3 transition count 3
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 3 transition count 3
Applied a total of 36 rules in 1 ms. Remains 3 /21 variables (removed 18) and now considering 3/21 (removed 18) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:42] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 14:09:42] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:42] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/21 places, 3/21 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Referendum-PT-0020-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s0 0), p2:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 8074 reset in 92 ms.
Product exploration explored 100000 steps with 8012 reset in 61 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p2))), (NOT p0), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Referendum-PT-0020-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-PT-0020-11 finished in 393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 4 transition count 4
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 4 transition count 4
Applied a total of 34 rules in 1 ms. Remains 4 /21 variables (removed 17) and now considering 4/21 (removed 17) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:42] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:42] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:42] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:42] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/21 places, 4/21 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-PT-0020-13 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, 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, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 53 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 : [(F (G (NOT p1))), (F (G (NOT p0))), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 42 ms.
Product exploration explored 100000 steps with 50000 reset in 58 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 4/4 places, 4/4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-17 14:09:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 14:09:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 14:09:43] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 4/4 transitions.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
[2021-05-17 14:09:43] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:09:43] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:09:43] [INFO ] Time to serialize gal into /tmp/LTL635862534666498479.gal : 2 ms
[2021-05-17 14:09:43] [INFO ] Time to serialize properties into /tmp/LTL10546185434110223068.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL635862534666498479.gal, -t, CGAL, -LTL, /tmp/LTL10546185434110223068.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL635862534666498479.gal -t CGAL -LTL /tmp/LTL10546185434110223068.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(voting_5==1)"))||(X(F("(voting_16==1)")))))
Formula 0 simplified : !(G"(voting_5==1)" | XF"(voting_16==1)")
Reverse transition relation is NOT exact ! Due to transitions t1, t5, t16, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/1/3/4
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.011557,16476,1,0,21,130,36,9,125,118,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-PT-0020-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-PT-0020-13 finished in 1050 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621260584649

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-0020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Referendum-PT-0020, 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 r178-tajo-162089415900533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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