About the Execution of ITS-Tools for Election2020-PT-none
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 379.844 | 9758.00 | 16407.00 | 251.50 | TFFFFFTFFTFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124155900093.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 Election2020-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124155900093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.7K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.7K May 11 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 115K May 12 08:13 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 Election2020-PT-none-00
FORMULA_NAME Election2020-PT-none-01
FORMULA_NAME Election2020-PT-none-02
FORMULA_NAME Election2020-PT-none-03
FORMULA_NAME Election2020-PT-none-04
FORMULA_NAME Election2020-PT-none-05
FORMULA_NAME Election2020-PT-none-06
FORMULA_NAME Election2020-PT-none-07
FORMULA_NAME Election2020-PT-none-08
FORMULA_NAME Election2020-PT-none-09
FORMULA_NAME Election2020-PT-none-10
FORMULA_NAME Election2020-PT-none-11
FORMULA_NAME Election2020-PT-none-12
FORMULA_NAME Election2020-PT-none-13
FORMULA_NAME Election2020-PT-none-14
FORMULA_NAME Election2020-PT-none-15
=== Now, execution of the tool begins
BK_START 1621268712034
Running Version 0
[2021-05-17 16:25:13] [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 16:25:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:25:13] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-17 16:25:13] [INFO ] Transformed 53 places.
[2021-05-17 16:25:13] [INFO ] Transformed 102 transitions.
[2021-05-17 16:25:13] [INFO ] Parsed PT model containing 53 places and 102 transitions in 86 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Support contains 28 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 102/102 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 51 transition count 51
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 41 transition count 41
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 41 transition count 41
Applied a total of 73 rules in 14 ms. Remains 41 /53 variables (removed 12) and now considering 41/102 (removed 61) transitions.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 16:25:13] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 16:25:13] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 16:25:13] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:13] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 16:25:13] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:14] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 41 cols
[2021-05-17 16:25:14] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/53 places, 41/102 transitions.
[2021-05-17 16:25:14] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 16:25:14] [INFO ] Flatten gal took : 21 ms
FORMULA Election2020-PT-none-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:25:14] [INFO ] Flatten gal took : 5 ms
[2021-05-17 16:25:14] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 68 steps, including 1 resets, run visited all 22 properties in 4 ms. (steps per millisecond=17 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 21 transition count 21
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 21 transition count 21
Applied a total of 40 rules in 2 ms. Remains 21 /41 variables (removed 20) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:14] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:14] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:14] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:14] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:14] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/41 places, 21/41 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-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 p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s11 1), p1:(LT s17 18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1694 reset in 223 ms.
Product exploration explored 100000 steps with 1694 reset in 178 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)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1694 reset in 110 ms.
Product exploration explored 100000 steps with 1694 reset in 127 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 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.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
[2021-05-17 16:25:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:15] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 21/21 transitions.
Product exploration explored 100000 steps with 1694 reset in 214 ms.
Product exploration explored 100000 steps with 1694 reset in 167 ms.
[2021-05-17 16:25:16] [INFO ] Flatten gal took : 2 ms
[2021-05-17 16:25:16] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:25:16] [INFO ] Time to serialize gal into /tmp/LTL10965830914235897662.gal : 1 ms
[2021-05-17 16:25:16] [INFO ] Time to serialize properties into /tmp/LTL13006701769974198191.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/LTL10965830914235897662.gal, -t, CGAL, -LTL, /tmp/LTL13006701769974198191.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/LTL10965830914235897662.gal -t CGAL -LTL /tmp/LTL13006701769974198191.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(ME>=1)"))&&(F(G("(OH<18)"))))))
Formula 0 simplified : !X(F"(ME>=1)" & FG"(OH<18)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
11 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.127607,20692,1,0,508,22692,27,505,355,40947,1303
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Election2020-PT-none-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Election2020-PT-none-00 finished in 2141 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||((p1 U p0)&&X(p2)))) U X(X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 22 transition count 22
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 22 transition count 22
Applied a total of 38 rules in 2 ms. Remains 22 /41 variables (removed 19) and now considering 22/41 (removed 19) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:16] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:16] [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 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/41 places, 22/41 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s9 4), p1:(GEQ s14 16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 1 reset in 0 ms.
FORMULA Election2020-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-01 finished in 186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X((p0&&X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 22 transition count 22
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 22 transition count 22
Applied a total of 38 rules in 1 ms. Remains 22 /41 variables (removed 19) and now considering 22/41 (removed 19) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:16] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:16] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 4 ms
[2021-05-17 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/41 places, 22/41 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s19 3), p1:(LT s6 3)], 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]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-02 finished in 265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(X((F(p1)&&X((p2||X(G(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 23 transition count 23
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 23 transition count 23
Applied a total of 36 rules in 2 ms. Remains 23 /41 variables (removed 18) and now considering 23/41 (removed 18) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:16] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:16] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:16] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/41 places, 23/41 transitions.
Stuttering acceptance computed with spot in 493 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p3), true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Election2020-PT-none-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 8}, { cond=(NOT p0), acceptance={} source=2 dest: 9}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=p3, acceptance={} source=6 dest: 6}, { cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(NOT p0), acceptance={} source=8 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 11}, { cond=p0, acceptance={} source=8 dest: 13}], [{ cond=(NOT p1), acceptance={} source=9 dest: 4}, { cond=true, acceptance={} source=9 dest: 12}], [{ cond=(NOT p2), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=10 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=12 dest: 15}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=13 dest: 10}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=13 dest: 13}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=13 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=14 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=14 dest: 11}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=14 dest: 14}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={} source=15 dest: 15}]], initial=0, aps=[p0:(GEQ s19 4), p1:(GEQ s9 20), p2:(GEQ s4 55), p3:(LT s13 10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 66 steps with 2 reset in 0 ms.
FORMULA Election2020-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-04 finished in 594 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((p0&&F((X(p1)&&(p2||X(!p0))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 23 transition count 23
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 23 transition count 23
Applied a total of 36 rules in 1 ms. Remains 23 /41 variables (removed 18) and now considering 23/41 (removed 18) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:17] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:17] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:17] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/41 places, 23/41 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p0), (OR (NOT p1) (AND p0 (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-05 automaton TGBA [mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND p0 p2) (AND p2 (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LT s19 6), p1:(LT s15 3), p0:(GEQ s16 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 98 steps with 20 reset in 1 ms.
FORMULA Election2020-PT-none-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-05 finished in 232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 21 transition count 21
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1 transition count 1
Applied a total of 58 rules in 12 ms. Remains 1 /41 variables (removed 40) and now considering 1/41 (removed 40) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:17] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:17] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 16:25:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:17] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:17] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/41 places, 1/41 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Election2020-PT-none-06 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 20000 reset in 147 ms.
Product exploration explored 100000 steps with 20000 reset in 91 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 Election2020-PT-none-06 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Election2020-PT-none-06 finished in 372 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 23 transition count 23
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 23 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 22 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 3 transition count 3
Applied a total of 54 rules in 24 ms. Remains 3 /41 variables (removed 38) and now considering 3/41 (removed 38) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-17 16:25:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/41 places, 3/41 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-07 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 p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s2 5), p1:(AND (GEQ s0 3) (GEQ s1 8))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-07 finished in 174 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(F(!p0))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 20 transition count 20
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 20 transition count 20
Applied a total of 42 rules in 1 ms. Remains 20 /41 variables (removed 21) and now considering 20/41 (removed 21) transitions.
// Phase 1: matrix 20 rows 20 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 20 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/41 places, 20/41 transitions.
Stuttering acceptance computed with spot in 130 ms :[p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Election2020-PT-none-08 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LT s16 18), p1:(GEQ s14 15)], 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]]
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-08 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 22 transition count 22
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 22 transition count 22
Applied a total of 38 rules in 1 ms. Remains 22 /41 variables (removed 19) and now considering 22/41 (removed 19) transitions.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:18] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 22 rows 22 cols
[2021-05-17 16:25:18] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/41 places, 22/41 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LT s21 3), p0:(OR (GEQ s21 3) (GEQ s20 10))], 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 136 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 22
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 p1)), (F (G (NOT p0))), (NOT p1), p0]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA Election2020-PT-none-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Election2020-PT-none-09 finished in 577 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 21 transition count 21
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1 transition count 1
Applied a total of 58 rules in 22 ms. Remains 1 /41 variables (removed 40) and now considering 1/41 (removed 40) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-17 16:25:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/41 places, 1/41 transitions.
Stuttering acceptance computed with spot in 53 ms :[p0, p0]
Running random walk in product with property : Election2020-PT-none-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s0 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-10 finished in 135 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 21 transition count 21
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 57 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1 transition count 1
Applied a total of 58 rules in 6 ms. Remains 1 /41 variables (removed 40) and now considering 1/41 (removed 40) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-17 16:25:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/41 places, 1/41 transitions.
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
Running random walk in product with property : Election2020-PT-none-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s0 16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-12 finished in 79 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 21 transition count 21
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 21 transition count 21
Applied a total of 40 rules in 1 ms. Remains 21 /41 variables (removed 20) and now considering 21/41 (removed 20) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/41 places, 21/41 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Election2020-PT-none-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(GEQ s19 13), p0:(GEQ s11 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-13 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 22 transition count 22
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 22 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 39 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 45 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 47 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 51 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 53 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 55 place count 3 transition count 3
Applied a total of 55 rules in 5 ms. Remains 3 /41 variables (removed 38) and now considering 3/41 (removed 38) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-17 16:25:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/41 places, 3/41 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 14) (AND (LT s0 11) (LT s1 6)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 31631 reset in 59 ms.
Product exploration explored 100000 steps with 31518 reset in 64 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)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Election2020-PT-none-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Election2020-PT-none-14 finished in 268 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0 U (G(p0)||(G(F(p2))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 41 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 41/41 places, 41/41 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 23 transition count 23
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 23 transition count 23
Applied a total of 36 rules in 1 ms. Remains 23 /41 variables (removed 18) and now considering 23/41 (removed 18) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:19] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:19] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/41 places, 23/41 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Election2020-PT-none-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s20 3) (LT s0 9)), p0:(AND (LT s20 3) (LT s0 9)), p2:(LT s9 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1694 reset in 143 ms.
Product exploration explored 100000 steps with 1694 reset in 157 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 23
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 p1)), (F (G p0)), (F (G p2)), (NOT p1), (NOT p0), (NOT p2)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Election2020-PT-none-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Election2020-PT-none-15 finished in 622 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621268721792
--------------------
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="Election2020-PT-none"
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 Election2020-PT-none, 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 r292-tall-162124155900093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Election2020-PT-none.tgz
mv Election2020-PT-none 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 '
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 ;