Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r169-tall-167838855400123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Election2020-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.9K Feb 25 21:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 21:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 30K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Feb 25 21:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 21:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 21:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 21:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K Mar 5 18:22 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-LTLCardinality-00
FORMULA_NAME Election2020-PT-none-LTLCardinality-01
FORMULA_NAME Election2020-PT-none-LTLCardinality-02
FORMULA_NAME Election2020-PT-none-LTLCardinality-03
FORMULA_NAME Election2020-PT-none-LTLCardinality-04
FORMULA_NAME Election2020-PT-none-LTLCardinality-05
FORMULA_NAME Election2020-PT-none-LTLCardinality-06
FORMULA_NAME Election2020-PT-none-LTLCardinality-07
FORMULA_NAME Election2020-PT-none-LTLCardinality-08
FORMULA_NAME Election2020-PT-none-LTLCardinality-09
FORMULA_NAME Election2020-PT-none-LTLCardinality-10
FORMULA_NAME Election2020-PT-none-LTLCardinality-11
FORMULA_NAME Election2020-PT-none-LTLCardinality-12
FORMULA_NAME Election2020-PT-none-LTLCardinality-13
FORMULA_NAME Election2020-PT-none-LTLCardinality-14
FORMULA_NAME Election2020-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678491028477

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 23:30:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 23:30:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 23:30:30] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-10 23:30:30] [INFO ] Transformed 53 places.
[2023-03-10 23:30:30] [INFO ] Transformed 102 transitions.
[2023-03-10 23:30:30] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Election2020-PT-none-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 88
Applied a total of 14 rules in 13 ms. Remains 46 /53 variables (removed 7) and now considering 88/102 (removed 14) transitions.
// Phase 1: matrix 88 rows 46 cols
[2023-03-10 23:30:30] [INFO ] Computed 1 place invariants in 11 ms
[2023-03-10 23:30:30] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
[2023-03-10 23:30:30] [INFO ] Invariant cache hit.
[2023-03-10 23:30:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-10 23:30:30] [INFO ] Invariant cache hit.
[2023-03-10 23:30:30] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-10 23:30:30] [INFO ] Invariant cache hit.
[2023-03-10 23:30:30] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/53 places, 88/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 46/53 places, 88/102 transitions.
Support contains 29 out of 46 places after structural reductions.
[2023-03-10 23:30:31] [INFO ] Flatten gal took : 22 ms
[2023-03-10 23:30:31] [INFO ] Flatten gal took : 9 ms
[2023-03-10 23:30:31] [INFO ] Input system was already deterministic with 88 transitions.
Finished random walk after 166 steps, including 2 resets, run visited all 29 properties in 23 ms. (steps per millisecond=7 )
FORMULA Election2020-PT-none-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&p1) U (!G((p2 U p3))&&p2)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 45 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 25 transition count 48
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 25 transition count 48
Applied a total of 41 rules in 7 ms. Remains 25 /46 variables (removed 21) and now considering 48/88 (removed 40) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-10 23:30:31] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:30:31] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-10 23:30:31] [INFO ] Invariant cache hit.
[2023-03-10 23:30:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 23:30:31] [INFO ] Invariant cache hit.
[2023-03-10 23:30:31] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-10 23:30:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 23:30:31] [INFO ] Invariant cache hit.
[2023-03-10 23:30:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/46 places, 48/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 156 ms. Remains : 25/46 places, 48/88 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p2) p3), p0, p3]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(LEQ 1 s3), p1:(LEQ 1 s8), p0:(LEQ s22 s14), p3:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5362 reset in 328 ms.
Product exploration explored 100000 steps with 5455 reset in 285 ms.
Computed a total of 25 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 6 factoid took 531 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[p3, p3]
Finished random walk after 2 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (NOT (AND (NOT p2) p1 p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (NOT p2)), (X p2), (X p0), (X (NOT p0)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (X (X p0)), (X (X (NOT p0))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 6 factoid took 662 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[p3, p3]
Stuttering acceptance computed with spot in 78 ms :[p3, p3]
[2023-03-10 23:30:34] [INFO ] Invariant cache hit.
[2023-03-10 23:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:34] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-10 23:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:34] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-10 23:30:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 23:30:34] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG p3
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2023-03-10 23:30:34] [INFO ] Invariant cache hit.
[2023-03-10 23:30:34] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-10 23:30:34] [INFO ] Invariant cache hit.
[2023-03-10 23:30:34] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 23:30:34] [INFO ] Invariant cache hit.
[2023-03-10 23:30:34] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 23:30:34] [INFO ] Invariant cache hit.
[2023-03-10 23:30:34] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132 ms. Remains : 25/25 places, 48/48 transitions.
Computed a total of 25 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 p3), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3)))))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[p3, p3]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p2 p3), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (AND p2 (NOT p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 339 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[p3, p3]
Stuttering acceptance computed with spot in 81 ms :[p3, p3]
[2023-03-10 23:30:35] [INFO ] Invariant cache hit.
[2023-03-10 23:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-10 23:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-10 23:30:35] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-10 23:30:35] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 103 ms :[p3, p3]
Product exploration explored 100000 steps with 5457 reset in 207 ms.
Product exploration explored 100000 steps with 5433 reset in 250 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 93 ms :[p3, p3]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 44
Applied a total of 4 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 44/48 (removed 4) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-10 23:30:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-10 23:30:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/25 places, 44/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 23/25 places, 44/48 transitions.
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 48/48 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 23 transition count 44
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 23 transition count 44
Applied a total of 4 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 44/48 (removed 4) transitions.
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/25 places, 44/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 23/25 places, 44/48 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-00 finished in 5066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||F(p2)))))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 4 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.0 ms
Discarding 42 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 4
Applied a total of 5 rules in 2 ms. Remains 4 /46 variables (removed 42) and now considering 4/88 (removed 84) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-10 23:30:36] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 23:30:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:36] [INFO ] Invariant cache hit.
[2023-03-10 23:30:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/46 places, 4/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 4/46 places, 4/88 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 s1), p2:(LEQ s0 s2), p0:(LEQ s3 s1)], 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 20161 reset in 96 ms.
Product exploration explored 100000 steps with 20163 reset in 97 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 12 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 382 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-10 23:30:37] [INFO ] Invariant cache hit.
[2023-03-10 23:30:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-10 23:30:38] [INFO ] Invariant cache hit.
[2023-03-10 23:30:38] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 23:30:38] [INFO ] Invariant cache hit.
[2023-03-10 23:30:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-10 23:30:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:38] [INFO ] Invariant cache hit.
[2023-03-10 23:30:38] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 5 factoid took 343 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Finished random walk after 7 steps, including 1 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 5 factoid took 381 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20160 reset in 118 ms.
Product exploration explored 100000 steps with 20167 reset in 59 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 23:30:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-01 finished in 2934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 2 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 23:30:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-10 23:30:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-02 automaton TGBA Formula[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}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], 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-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-02 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 3 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 23:30:39] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-10 23:30:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(GT s0 s2)], 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-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-04 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0||X(X(X(X(p1)))))) U X(X(p2)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 44 transition count 44
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 65 place count 25 transition count 25
Iterating global reduction 1 with 19 rules applied. Total rules applied 84 place count 25 transition count 25
Applied a total of 84 rules in 10 ms. Remains 25 /46 variables (removed 21) and now considering 25/88 (removed 63) transitions.
// Phase 1: matrix 25 rows 25 cols
[2023-03-10 23:30:39] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:30:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-10 23:30:39] [INFO ] Invariant cache hit.
[2023-03-10 23:30:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 23:30:40] [INFO ] Invariant cache hit.
[2023-03-10 23:30:40] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 23:30:40] [INFO ] Invariant cache hit.
[2023-03-10 23:30:40] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/46 places, 25/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 25/46 places, 25/88 transitions.
Stuttering acceptance computed with spot in 539 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 11}, { cond=(NOT p2), acceptance={0} source=4 dest: 12}], [{ cond=(NOT p2), acceptance={} source=5 dest: 7}], [{ cond=(NOT p2), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=true, acceptance={} source=10 dest: 7}], [{ cond=true, acceptance={} source=11 dest: 10}], [{ cond=(NOT p0), acceptance={} source=12 dest: 11}, { cond=true, acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(LEQ s14 s10), p2:(LEQ 2 s6), p1:(LEQ s2 s21)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 176 steps with 27 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(p0 U p1)&&X(((G(p0)&&p0) U p2)))))'
Support contains 5 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 25 transition count 48
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 25 transition count 48
Applied a total of 41 rules in 3 ms. Remains 25 /46 variables (removed 21) and now considering 48/88 (removed 40) transitions.
// Phase 1: matrix 48 rows 25 cols
[2023-03-10 23:30:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:30:40] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-03-10 23:30:40] [INFO ] Invariant cache hit.
[2023-03-10 23:30:40] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 23:30:40] [INFO ] Invariant cache hit.
[2023-03-10 23:30:40] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-10 23:30:40] [INFO ] Invariant cache hit.
[2023-03-10 23:30:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/46 places, 48/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 25/46 places, 48/88 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1, (NOT p2), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s15 s21), p0:(LEQ s0 s19), p2:(GT 1 s23)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 14 steps with 2 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-06 finished in 363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 24 transition count 46
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 24 transition count 46
Applied a total of 43 rules in 5 ms. Remains 24 /46 variables (removed 22) and now considering 46/88 (removed 42) transitions.
// Phase 1: matrix 46 rows 24 cols
[2023-03-10 23:30:40] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:30:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-03-10 23:30:41] [INFO ] Invariant cache hit.
[2023-03-10 23:30:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 23:30:41] [INFO ] Invariant cache hit.
[2023-03-10 23:30:41] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 23:30:41] [INFO ] Invariant cache hit.
[2023-03-10 23:30:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/46 places, 46/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 24/46 places, 46/88 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s6 s0) (LEQ s16 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 1 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-07 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 23 transition count 44
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 23 transition count 44
Applied a total of 45 rules in 4 ms. Remains 23 /46 variables (removed 23) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-10 23:30:41] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:30:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-10 23:30:41] [INFO ] Invariant cache hit.
[2023-03-10 23:30:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 23:30:41] [INFO ] Invariant cache hit.
[2023-03-10 23:30:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 23:30:41] [INFO ] Invariant cache hit.
[2023-03-10 23:30:41] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/46 places, 44/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 23/46 places, 44/88 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(LEQ 1 s0), p0:(GT s13 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33762 reset in 174 ms.
Product exploration explored 100000 steps with 33920 reset in 173 ms.
Computed a total of 23 stabilizing places and 44 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 44
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 383 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 3 factoid took 245 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-10 23:30:42] [INFO ] Invariant cache hit.
[2023-03-10 23:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:42] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-10 23:30:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned unsat
Proved EG (AND (NOT p1) (NOT p0))
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (G (AND (NOT p1) (NOT p0)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-08 finished in 2134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(p0)) U X(p1))))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 3 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.0 ms
Discarding 43 places :
Also discarding 82 output transitions
Drop transitions removed 82 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 3 ms. Remains 3 /46 variables (removed 43) and now considering 3/88 (removed 85) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 23:30:43] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 23:30:43] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
[2023-03-10 23:30:43] [INFO ] Invariant cache hit.
[2023-03-10 23:30:43] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 23:30:43] [INFO ] Invariant cache hit.
[2023-03-10 23:30:43] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-10 23:30:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:43] [INFO ] Invariant cache hit.
[2023-03-10 23:30:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/46 places, 3/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 83 ms. Remains : 3/46 places, 3/88 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s0 s2)], 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 25525 reset in 88 ms.
Product exploration explored 100000 steps with 25518 reset in 80 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 261 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-10 23:30:44] [INFO ] Invariant cache hit.
[2023-03-10 23:30:44] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-10 23:30:44] [INFO ] Invariant cache hit.
[2023-03-10 23:30:44] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-10 23:30:44] [INFO ] Invariant cache hit.
[2023-03-10 23:30:44] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-10 23:30:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:44] [INFO ] Invariant cache hit.
[2023-03-10 23:30:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Finished random walk after 10 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25531 reset in 47 ms.
Product exploration explored 100000 steps with 25530 reset in 44 ms.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 0 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 23:30:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-10 23:30:45] [INFO ] Invariant cache hit.
[2023-03-10 23:30:45] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 23:30:45] [INFO ] Invariant cache hit.
[2023-03-10 23:30:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-10 23:30:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:45] [INFO ] Invariant cache hit.
[2023-03-10 23:30:45] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 84 ms. Remains : 2/3 places, 2/3 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-11 finished in 2007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 44 transition count 44
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 68 place count 22 transition count 22
Iterating global reduction 1 with 22 rules applied. Total rules applied 90 place count 22 transition count 22
Applied a total of 90 rules in 3 ms. Remains 22 /46 variables (removed 24) and now considering 22/88 (removed 66) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 23:30:45] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-10 23:30:45] [INFO ] Invariant cache hit.
[2023-03-10 23:30:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 23:30:45] [INFO ] Invariant cache hit.
[2023-03-10 23:30:45] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-10 23:30:45] [INFO ] Invariant cache hit.
[2023-03-10 23:30:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/46 places, 22/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 22/46 places, 22/88 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s5), p0:(GT 3 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1984 reset in 108 ms.
Product exploration explored 100000 steps with 2000 reset in 116 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
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 (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 3 factoid took 330 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 135 steps, including 1 resets, run visited all 3 properties in 5 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 23:30:47] [INFO ] Invariant cache hit.
[2023-03-10 23:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:47] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 23:30:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:47] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-10 23:30:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 23:30:47] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 23:30:47] [INFO ] Invariant cache hit.
[2023-03-10 23:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 23:30:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-10 23:30:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 23:30:47] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-10 23:30:47] [INFO ] Invariant cache hit.
[2023-03-10 23:30:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-10 23:30:47] [INFO ] Invariant cache hit.
[2023-03-10 23:30:47] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 23:30:47] [INFO ] Invariant cache hit.
[2023-03-10 23:30:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 23:30:47] [INFO ] Invariant cache hit.
[2023-03-10 23:30:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 22/22 places, 22/22 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
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 (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (NOT p0))), (X (X p0)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 406 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 23:30:48] [INFO ] Invariant cache hit.
[2023-03-10 23:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:48] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 23:30:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 23:30:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 23:30:48] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 23:30:48] [INFO ] Invariant cache hit.
[2023-03-10 23:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:48] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-10 23:30:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:48] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 23:30:48] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 23:30:48] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1996 reset in 101 ms.
Product exploration explored 100000 steps with 2009 reset in 116 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Graph (complete) has 0 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions removed 20 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /22 variables (removed 20) and now considering 2/22 (removed 20) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 23:30:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-10 23:30:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 2/22 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 2/22 places, 2/22 transitions.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 22 cols
[2023-03-10 23:30:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 22/22 places, 22/22 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 4281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(G(p1))))))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 45 transition count 88
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 23 place count 23 transition count 44
Iterating global reduction 1 with 22 rules applied. Total rules applied 45 place count 23 transition count 44
Applied a total of 45 rules in 3 ms. Remains 23 /46 variables (removed 23) and now considering 44/88 (removed 44) transitions.
// Phase 1: matrix 44 rows 23 cols
[2023-03-10 23:30:49] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-10 23:30:49] [INFO ] Invariant cache hit.
[2023-03-10 23:30:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 23/46 places, 44/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 23/46 places, 44/88 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(LEQ 2 s15), p1:(LEQ s0 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-15 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)&&p1) U (!G((p2 U p3))&&p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((p1||F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((X(X(p0)) U X(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Found a Shortening insensitive property : Election2020-PT-none-LTLCardinality-12
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 46/46 places, 88/88 transitions.
Graph (complete) has 88 edges and 46 vertex of which 2 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.0 ms
Discarding 44 places :
Also discarding 84 output transitions
Drop transitions removed 84 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 3 ms. Remains 2 /46 variables (removed 44) and now considering 2/88 (removed 86) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 23:30:50] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 23:30:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-10 23:30:50] [INFO ] Invariant cache hit.
[2023-03-10 23:30:50] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 23:30:50] [INFO ] Invariant cache hit.
[2023-03-10 23:30:50] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-10 23:30:50] [INFO ] Invariant cache hit.
[2023-03-10 23:30:50] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2/46 places, 2/88 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72 ms. Remains : 2/46 places, 2/88 transitions.
Running random walk in product with property : Election2020-PT-none-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GT 3 s0), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 43 ms.
Product exploration explored 100000 steps with 33333 reset in 44 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 365 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 353 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 23:30:51] [INFO ] Invariant cache hit.
[2023-03-10 23:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:51] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-10 23:30:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 23:30:51] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 23:30:51] [INFO ] Invariant cache hit.
[2023-03-10 23:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:51] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-10 23:30:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:51] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-10 23:30:51] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 23:30:51] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 23:30:51] [INFO ] Invariant cache hit.
[2023-03-10 23:30:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-10 23:30:51] [INFO ] Invariant cache hit.
[2023-03-10 23:30:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 23:30:51] [INFO ] Invariant cache hit.
[2023-03-10 23:30:52] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 23:30:52] [INFO ] Invariant cache hit.
[2023-03-10 23:30:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1)]
Knowledge based reduction with 6 factoid took 412 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 4 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (F p1), (F p0), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 348 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:53] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 23:30:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 23:30:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:53] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 23:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 23:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 23:30:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-10 23:30:53] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 23:30:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 46 ms.
Product exploration explored 100000 steps with 33333 reset in 45 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2023-03-10 23:30:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 2/2 places, 2/2 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-10 23:30:53] [INFO ] Invariant cache hit.
[2023-03-10 23:30:53] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 3827 ms.
[2023-03-10 23:30:54] [INFO ] Flatten gal took : 7 ms
[2023-03-10 23:30:54] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 23:30:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 88 transitions and 176 arcs took 1 ms.
Total runtime 23823 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2375/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2375/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2375/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2375/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Election2020-PT-none-LTLCardinality-00
Could not compute solution for formula : Election2020-PT-none-LTLCardinality-01
Could not compute solution for formula : Election2020-PT-none-LTLCardinality-11
Could not compute solution for formula : Election2020-PT-none-LTLCardinality-12

BK_STOP 1678491055840

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Election2020-PT-none-LTLCardinality-00
ltl formula formula --ltl=/tmp/2375/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 88 transitions and 176 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2375/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2375/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2375/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2375/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Election2020-PT-none-LTLCardinality-01
ltl formula formula --ltl=/tmp/2375/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 88 transitions and 176 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2375/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2375/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2375/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2375/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Election2020-PT-none-LTLCardinality-11
ltl formula formula --ltl=/tmp/2375/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 88 transitions and 176 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2375/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2375/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2375/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2375/ltl_2_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name Election2020-PT-none-LTLCardinality-12
ltl formula formula --ltl=/tmp/2375/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 46 places, 88 transitions and 176 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2375/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2375/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2375/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2375/ltl_3_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Election2020-PT-none, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855400123"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;