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-162089415800469.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-COL-0020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089415800469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K 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 3.7K Mar 28 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 10:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 10:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 13:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 3.8K 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-COL-0020-00
FORMULA_NAME Referendum-COL-0020-01
FORMULA_NAME Referendum-COL-0020-02
FORMULA_NAME Referendum-COL-0020-03
FORMULA_NAME Referendum-COL-0020-04
FORMULA_NAME Referendum-COL-0020-05
FORMULA_NAME Referendum-COL-0020-06
FORMULA_NAME Referendum-COL-0020-07
FORMULA_NAME Referendum-COL-0020-08
FORMULA_NAME Referendum-COL-0020-09
FORMULA_NAME Referendum-COL-0020-10
FORMULA_NAME Referendum-COL-0020-11
FORMULA_NAME Referendum-COL-0020-12
FORMULA_NAME Referendum-COL-0020-13
FORMULA_NAME Referendum-COL-0020-14
FORMULA_NAME Referendum-COL-0020-15

=== Now, execution of the tool begins

BK_START 1621258906701

Running Version 0
[2021-05-17 13:41:48] [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 13:41:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 13:41:48] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2021-05-17 13:41:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 13:41:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 518 ms
[2021-05-17 13:41:48] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 61 PT places and 41.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-COL-0020-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 13:41:49] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions in 3 ms.
[2021-05-17 13:41:49] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_6653186992995852567.dot
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2021-05-17 13:41:49] [INFO ] Flatten gal took : 35 ms
[2021-05-17 13:41:49] [INFO ] Flatten gal took : 1 ms
[2021-05-17 13:41:49] [INFO ] Unfolded HLPN to a Petri net with 61 places and 41 transitions in 2 ms.
[2021-05-17 13:41:49] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_3485683781884832584.dot
[2021-05-17 13:41:49] [INFO ] Initial state test concluded for 3 properties.
FORMULA Referendum-COL-0020-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0020-13 TRUE 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 23 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 13:41:49] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 13:41:49] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/61 places, 21/41 transitions.
[2021-05-17 13:41:49] [INFO ] Flatten gal took : 7 ms
[2021-05-17 13:41:49] [INFO ] Flatten gal took : 5 ms
[2021-05-17 13:41:49] [INFO ] Input system was already deterministic with 21 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 5 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 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 13:41:49] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:49] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:49] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:49] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 354 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-COL-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 (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p1:(GEQ 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-COL-0020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-00 finished in 520 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 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 13:41:50] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:50] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:50] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:50] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:50] [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 180 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-COL-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 (LT s1 1) (LT s3 1) (LT s2 1) (LT s5 1) (LT s4 1) (LT s7 1) (LT s6 1) (LT s9 1) (LT s8 1) (LT s11 1) (LT s10 1) (LT s13 1) (LT s12 1) (LT s15 1) (LT s14 1) (LT s17 1) (LT s16 1) (LT s19 1) (LT s18 1) (LT s20 1)), p1:(GEQ s0 1), p2:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ 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-COL-0020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-01 finished in 257 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 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 13:41:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:50] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:50] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:50] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:50] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) 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 (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p1:(GEQ s0 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 297 ms.
Product exploration explored 100000 steps with 50000 reset in 183 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 p1))), (NOT p0), p1]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) 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 13:41:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:52] [INFO ] Computed 0 place invariants in 5 ms
[2021-05-17 13:41:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 50000 reset in 325 ms.
Product exploration explored 100000 steps with 50000 reset in 371 ms.
[2021-05-17 13:41:52] [INFO ] Flatten gal took : 4 ms
[2021-05-17 13:41:52] [INFO ] Flatten gal took : 4 ms
[2021-05-17 13:41:52] [INFO ] Time to serialize gal into /tmp/LTL10393233729555342998.gal : 4 ms
[2021-05-17 13:41:52] [INFO ] Time to serialize properties into /tmp/LTL14934536389690677892.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/LTL10393233729555342998.gal, -t, CGAL, -LTL, /tmp/LTL14934536389690677892.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/LTL10393233729555342998.gal -t CGAL -LTL /tmp/LTL14934536389690677892.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))"))||(X("(ready_0<1)"))))
Formula 0 simplified : !(F"((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))" | X"(ready_0<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.036665,16680,1,0,72,1677,65,26,573,1148,54
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-COL-0020-02 finished in 2576 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 3 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 13:41:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-17 13:41:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 10 ms
[2021-05-17 13:41:53] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Referendum-COL-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:(GEQ s0 1), p0:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ 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 301 ms.
Product exploration explored 100000 steps with 4545 reset in 141 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-COL-0020-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0020-03 finished in 799 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 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 13:41:53] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:53] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:53] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 299 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-COL-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 (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p2:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p1:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p3:(GEQ 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 107 ms.
Product exploration explored 100000 steps with 50000 reset in 119 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 255 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 105 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Applying partial POR strategy [false, false, false, true, false, true, false]
Stuttering acceptance computed with spot in 349 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 0 ms. Remains 21 /21 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-17 13:41:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:56] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 50000 reset in 89 ms.
Product exploration explored 100000 steps with 50000 reset in 99 ms.
[2021-05-17 13:41:56] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:41:56] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:41:56] [INFO ] Time to serialize gal into /tmp/LTL16334059420973946245.gal : 1 ms
[2021-05-17 13:41:56] [INFO ] Time to serialize properties into /tmp/LTL3834629304935015870.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/LTL16334059420973946245.gal, -t, CGAL, -LTL, /tmp/LTL3834629304935015870.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/LTL16334059420973946245.gal -t CGAL -LTL /tmp/LTL3834629304935015870.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))")||(X((("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))")||(G(("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))")U(X("(ready_0>=1)")))))U("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))"))))))
Formula 0 simplified : !X("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))" | X(("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))" | G("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))" U X"(ready_0>=1)")) U "((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=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.04094,17456,1,0,72,1677,60,26,554,1148,52
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Referendum-COL-0020-04 finished in 2693 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 2 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 13:41:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:56] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:56] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-17 13:41:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:56] [INFO ] Dead Transitions using invariants and state equation in 25 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-COL-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 (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ 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-COL-0020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-05 finished in 122 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 13:41:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:56] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:56] [INFO ] Implicit Places using invariants and state equation in 22 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 13:41:56] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-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 (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ 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 84 ms.
Product exploration explored 100000 steps with 50000 reset in 96 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 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 84 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 13:41:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:57] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
[2021-05-17 13:41:58] [INFO ] Flatten gal took : 3 ms
[2021-05-17 13:41:58] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:41:58] [INFO ] Time to serialize gal into /tmp/LTL7229745908679124479.gal : 1 ms
[2021-05-17 13:41:58] [INFO ] Time to serialize properties into /tmp/LTL6047364831918336438.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/LTL7229745908679124479.gal, -t, CGAL, -LTL, /tmp/LTL6047364831918336438.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/LTL7229745908679124479.gal -t CGAL -LTL /tmp/LTL6047364831918336438.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))"))))
Formula 0 simplified : !XF"((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=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
0 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.022524,16688,1,0,72,1677,66,26,551,1148,54
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-COL-0020-07 finished in 1364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2 transition count 2
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1 transition count 1
Applied a total of 40 rules in 4 ms. Remains 1 /21 variables (removed 20) and now considering 1/21 (removed 20) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 13:41:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/21 places, 1/21 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 1 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0020-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-08 finished in 93 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&X(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 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 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : Referendum-COL-0020-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-09 finished in 256 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0&&G(p1))) U 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 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 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-17 13:41:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [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 74 ms :[(NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0020-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1)), p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0020-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-10 finished in 159 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 places, 21/21 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 2 transition count 2
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 2 transition count 2
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 2 transition count 1
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 1 transition count 1
Applied a total of 40 rules in 2 ms. Remains 1 /21 variables (removed 20) and now considering 1/21 (removed 20) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-17 13:41:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/21 places, 1/21 transitions.
Stuttering acceptance computed with spot in 31 ms :[p0]
Running random walk in product with property : Referendum-COL-0020-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 90 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Referendum-COL-0020-11 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Referendum-COL-0020-11 finished in 318 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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 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 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:41:58] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:58] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:58] [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 63 ms :[true, p0, p0]
Running random walk in product with property : Referendum-COL-0020-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-12 finished in 115 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(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 13:41:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:59] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:59] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 13:41:59] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:41:59] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-17 13:41:59] [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.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (GEQ s1 1) (GEQ s3 1) (GEQ s2 1) (GEQ s5 1) (GEQ s4 1) (GEQ s7 1) (GEQ s6 1) (GEQ s9 1) (GEQ s8 1) (GEQ s11 1) (GEQ s10 1) (GEQ s13 1) (GEQ s12 1) (GEQ s15 1) (GEQ s14 1) (GEQ s17 1) (GEQ s16 1) (GEQ s19 1) (GEQ s18 1) (GEQ 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Product exploration explored 100000 steps with 25000 reset in 217 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 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 143 ms.
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (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 13:42:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 13:42:00] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 13:42:00] [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 25000 reset in 180 ms.
Product exploration explored 100000 steps with 25000 reset in 192 ms.
[2021-05-17 13:42:00] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:42:00] [INFO ] Flatten gal took : 2 ms
[2021-05-17 13:42:00] [INFO ] Time to serialize gal into /tmp/LTL13248782850146633185.gal : 4 ms
[2021-05-17 13:42:00] [INFO ] Time to serialize properties into /tmp/LTL1526937194276317961.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/LTL13248782850146633185.gal, -t, CGAL, -LTL, /tmp/LTL1526937194276317961.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/LTL13248782850146633185.gal -t CGAL -LTL /tmp/LTL1526937194276317961.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X(X(F("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))"))))&&("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))")))))
Formula 0 simplified : !XF("((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=1))" & XXF"((((((((((((((((((((voting_0>=1)||(voting_2>=1))||(voting_1>=1))||(voting_4>=1))||(voting_3>=1))||(voting_6>=1))||(voting_5>=1))||(voting_8>=1))||(voting_7>=1))||(voting_10>=1))||(voting_9>=1))||(voting_12>=1))||(voting_11>=1))||(voting_14>=1))||(voting_13>=1))||(voting_16>=1))||(voting_15>=1))||(voting_18>=1))||(voting_17>=1))||(voting_19>=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
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 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.041883,16864,1,0,74,1752,67,28,571,1245,64
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Referendum-COL-0020-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property Referendum-COL-0020-14 finished in 1844 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621258921700

--------------------
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-COL-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-COL-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-162089415800469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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