Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r157-smll-171636265200211.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r157-smll-171636265200211
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 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 1716548781290

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 11:06:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 11:06:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 11:06:23] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-24 11:06:23] [INFO ] Transformed 53 places.
[2024-05-24 11:06:23] [INFO ] Transformed 102 transitions.
[2024-05-24 11:06:23] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 114 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Election2020-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 38 transition count 72
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 38 transition count 72
Applied a total of 30 rules in 30 ms. Remains 38 /53 variables (removed 15) and now considering 72/102 (removed 30) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 5ms
// Phase 1: matrix 72 rows 38 cols
[2024-05-24 11:06:23] [INFO ] Computed 1 invariants in 8 ms
[2024-05-24 11:06:23] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-24 11:06:23] [INFO ] Invariant cache hit.
[2024-05-24 11:06:24] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 38/53 places, 72/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 38/53 places, 72/102 transitions.
Support contains 22 out of 38 places after structural reductions.
[2024-05-24 11:06:24] [INFO ] Flatten gal took : 34 ms
[2024-05-24 11:06:24] [INFO ] Flatten gal took : 14 ms
[2024-05-24 11:06:24] [INFO ] Input system was already deterministic with 72 transitions.
RANDOM walk for 837 steps (11 resets) in 109 ms. (7 steps per ms) remains 0/16 properties
FORMULA Election2020-PT-none-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 72 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 38 transition count 72
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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 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 19 ms. Remains 2 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 11:06:24] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 11:06:24] [INFO ] Invariant cache hit.
[2024-05-24 11:06:24] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 11:06:24] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 2/38 places, 2/72 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA Election2020-PT-none-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-00 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 1 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 2 ms. Remains 1 /38 variables (removed 37) and now considering 1/72 (removed 71) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 1 rows 1 cols
[2024-05-24 11:06:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:25] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 11:06:25] [INFO ] Invariant cache hit.
[2024-05-24 11:06:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-24 11:06:25] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1/38 places, 1/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 1/38 places, 1/72 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 148 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-24 11:06:26] [INFO ] Invariant cache hit.
[2024-05-24 11:06:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:06:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:06:26] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:26] [INFO ] Invariant cache hit.
[2024-05-24 11:06:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 11:06:26] [INFO ] Invariant cache hit.
[2024-05-24 11:06:26] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 11:06:26] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 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 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 128 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2024-05-24 11:06:26] [INFO ] Invariant cache hit.
[2024-05-24 11:06:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:06:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:06:26] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:27] [INFO ] Invariant cache hit.
[2024-05-24 11:06:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:06:27] [INFO ] Invariant cache hit.
[2024-05-24 11:06:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 11:06:27] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53 ms. Remains : 1/1 places, 1/1 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-04 finished in 2199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 23 transition count 23
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 23 transition count 23
Applied a total of 64 rules in 7 ms. Remains 23 /38 variables (removed 15) and now considering 23/72 (removed 49) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 23 rows 23 cols
[2024-05-24 11:06:27] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 11:06:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 11:06:27] [INFO ] Invariant cache hit.
[2024-05-24 11:06:27] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 23/38 places, 23/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 23/38 places, 23/72 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05
Product exploration explored 100000 steps with 1694 reset in 340 ms.
Product exploration explored 100000 steps with 1694 reset in 435 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 878 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2367 steps (30 resets) in 49 ms. (47 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1273 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 23/23 transitions.
Graph (complete) has 0 edges and 23 vertex of which 4 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 19 output transitions
Drop transitions (Output transitions of discarded places.) removed 19 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /23 variables (removed 19) and now considering 4/23 (removed 19) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 11:06:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:30] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 11:06:30] [INFO ] Invariant cache hit.
[2024-05-24 11:06:30] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-24 11:06:30] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/23 places, 4/23 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 4/23 places, 4/23 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 12 factoid took 722 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 161 steps (13 resets) in 8 ms. (17 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1244 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11111 reset in 94 ms.
Product exploration explored 100000 steps with 11111 reset in 102 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 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:33] [INFO ] Invariant cache hit.
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 11:06:33] [INFO ] Invariant cache hit.
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 11:06:33] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 6129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(G(p1))) U (p2||X(!p0))))'
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 7 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 11:06:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 11:06:33] [INFO ] Invariant cache hit.
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p1)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-06 finished in 328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 21 transition count 21
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 21 transition count 21
Applied a total of 68 rules in 4 ms. Remains 21 /38 variables (removed 17) and now considering 21/72 (removed 51) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 21 rows 21 cols
[2024-05-24 11:06:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 11:06:33] [INFO ] Invariant cache hit.
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 21/38 places, 21/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 21/38 places, 21/72 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-08 finished in 166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p1||F(p2)))||p0))))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 26 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 26 transition count 50
Applied a total of 23 rules in 10 ms. Remains 26 /38 variables (removed 12) and now considering 50/72 (removed 22) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 50 rows 26 cols
[2024-05-24 11:06:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 11:06:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 11:06:33] [INFO ] Invariant cache hit.
[2024-05-24 11:06:34] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-24 11:06:34] [INFO ] Redundant transitions in 2 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 50/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 26/38 places, 50/72 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-10
Product exploration explored 100000 steps with 1696 reset in 284 ms.
Product exploration explored 100000 steps with 1700 reset in 335 ms.
Computed a total of 26 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 50
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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 1666 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 83 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 37629 steps (536 resets) in 160 ms. (233 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 2121 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 p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 26 /26 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:38] [INFO ] Invariant cache hit.
[2024-05-24 11:06:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 11:06:38] [INFO ] Invariant cache hit.
[2024-05-24 11:06:38] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 11:06:38] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 26/26 places, 50/50 transitions.
Computed a total of 26 stabilizing places and 50 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 50
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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 1632 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 p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 22250 steps (316 resets) in 54 ms. (404 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1 p0))), (F (NOT (OR p2 (NOT p1) p0)))]
Knowledge based reduction with 5 factoid took 2093 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 85 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 1699 reset in 210 ms.
Product exploration explored 100000 steps with 1705 reset in 235 ms.
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:43] [INFO ] Invariant cache hit.
[2024-05-24 11:06:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 11:06:43] [INFO ] Invariant cache hit.
[2024-05-24 11:06:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-24 11:06:43] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 26/26 places, 50/50 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-10 finished in 9739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 24 transition count 46
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 24 transition count 46
Applied a total of 27 rules in 6 ms. Remains 24 /38 variables (removed 14) and now considering 46/72 (removed 26) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 46 rows 24 cols
[2024-05-24 11:06:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 11:06:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 11:06:43] [INFO ] Invariant cache hit.
[2024-05-24 11:06:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-24 11:06:43] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/38 places, 46/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 24/38 places, 46/72 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-11
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-11 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&G(p1)))))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 11:06:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 11:06:43] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-24 11:06:43] [INFO ] Invariant cache hit.
[2024-05-24 11:06:44] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 164 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
Product exploration explored 100000 steps with 2024 reset in 124 ms.
Product exploration explored 100000 steps with 1989 reset in 154 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 (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 505 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
RANDOM walk for 764 steps (8 resets) in 6 ms. (109 steps per ms) remains 0/4 properties
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 (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 3 factoid took 676 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 11:06:46] [INFO ] Invariant cache hit.
[2024-05-24 11:06:46] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-24 11:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:46] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-24 11:06:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 11:06:46] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-24 11:06:46] [INFO ] Invariant cache hit.
[2024-05-24 11:06:46] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 11:06:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:46] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-24 11:06:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 11:06:46] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (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 (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /22 variables (removed 20) and now considering 2/22 (removed 20) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 11:06:46] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 11:06:46] [INFO ] Invariant cache hit.
[2024-05-24 11:06:46] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-24 11:06:46] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
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 44 ms. Remains : 2/22 places, 2/22 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 p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0))]
Knowledge based reduction with 8 factoid took 554 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (X (X (AND p0 p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p0)]
Knowledge based reduction with 8 factoid took 796 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 11:06:49] [INFO ] Invariant cache hit.
[2024-05-24 11:06:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:06:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:06:49] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-24 11:06:49] [INFO ] Invariant cache hit.
[2024-05-24 11:06:49] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:06:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:49] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-24 11:06:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:06:49] [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 222 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Product exploration explored 100000 steps with 33333 reset in 59 ms.
Product exploration explored 100000 steps with 33333 reset in 75 ms.
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 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:49] [INFO ] Invariant cache hit.
[2024-05-24 11:06:49] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 11:06:49] [INFO ] Invariant cache hit.
[2024-05-24 11:06:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-24 11:06:49] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 5641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 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 1 ms. Remains 2 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 11:06:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:49] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 11:06:49] [INFO ] Invariant cache hit.
[2024-05-24 11:06:49] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 11:06:49] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60 ms. Remains : 2/38 places, 2/72 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-13
Product exploration explored 100000 steps with 39966 reset in 43 ms.
Product exploration explored 100000 steps with 40004 reset in 45 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 : [(NOT p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Election2020-PT-none-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Election2020-PT-none-LTLCardinality-13 finished in 289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 36 transition count 36
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 22 transition count 22
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 22 transition count 22
Applied a total of 66 rules in 2 ms. Remains 22 /38 variables (removed 16) and now considering 22/72 (removed 50) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 22 rows 22 cols
[2024-05-24 11:06:49] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 11:06:49] [INFO ] Invariant cache hit.
[2024-05-24 11:06:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 22/38 places, 22/72 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 22/38 places, 22/72 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-LTLCardinality-14
Stuttering criterion allowed to conclude after 58 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-LTLCardinality-14 finished in 220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Found a Lengthening insensitive property : Election2020-PT-none-LTLCardinality-05
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 4 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 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 /38 variables (removed 34) and now considering 4/72 (removed 68) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
// Phase 1: matrix 4 rows 4 cols
[2024-05-24 11:06:50] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 11:06:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 11:06:50] [INFO ] Invariant cache hit.
[2024-05-24 11:06:50] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LI_LTL mode, iteration 1 : 4/38 places, 4/72 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 48 ms. Remains : 4/38 places, 4/72 transitions.
Running random walk in product with property : Election2020-PT-none-LTLCardinality-05
Product exploration explored 100000 steps with 11111 reset in 90 ms.
Product exploration explored 100000 steps with 11111 reset in 89 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 (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 720 ms. Reduced automaton from 2 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 121 steps (9 resets) in 4 ms. (24 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1281 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:53] [INFO ] Invariant cache hit.
[2024-05-24 11:06:53] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 11:06:53] [INFO ] Invariant cache hit.
[2024-05-24 11:06:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-24 11:06:53] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 12 factoid took 867 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 290 steps (26 resets) in 5 ms. (48 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 1325 ms. Reduced automaton from 2 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 11111 reset in 89 ms.
Product exploration explored 100000 steps with 11111 reset in 93 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.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:55] [INFO ] Invariant cache hit.
[2024-05-24 11:06:56] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 11:06:56] [INFO ] Invariant cache hit.
[2024-05-24 11:06:56] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-24 11:06:56] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-05 finished in 5583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((!p1||F(p2)))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/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 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 38/38 places, 72/72 transitions.
Graph (complete) has 72 edges and 38 vertex of which 2 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 68 output transitions
Drop transitions (Output transitions of discarded places.) removed 68 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 /38 variables (removed 36) and now considering 2/72 (removed 70) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
// Phase 1: matrix 2 rows 2 cols
[2024-05-24 11:06:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 11:06:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 11:06:56] [INFO ] Invariant cache hit.
[2024-05-24 11:06:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LI_LTL mode, iteration 1 : 2/38 places, 2/72 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 56 ms. Remains : 2/38 places, 2/72 transitions.
Running random walk in product with property : Election2020-PT-none-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 44 ms.
Product exploration explored 100000 steps with 33333 reset in 50 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 (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 416 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
RANDOM walk for 12 steps (2 resets) in 5 ms. (2 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p1), (X p0), (X (NOT p0)), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p0)]
Knowledge based reduction with 6 factoid took 622 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 11:06:58] [INFO ] Invariant cache hit.
[2024-05-24 11:06:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 11:06:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:06:58] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-24 11:06:58] [INFO ] Invariant cache hit.
[2024-05-24 11:06:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:06:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:06:58] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:06:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:06:58] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
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.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:06:58] [INFO ] Invariant cache hit.
[2024-05-24 11:06:58] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 11:06:58] [INFO ] Invariant cache hit.
[2024-05-24 11:06:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 11:06:58] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 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 (NOT (AND p1 p0))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (X (X (NOT (AND 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 p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 614 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (X (AND p1 p0))), (X (X p1)), (X (X p0)), (X (X (NOT (AND 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 p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 8 factoid took 782 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 6 states, 14 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
[2024-05-24 11:07:00] [INFO ] Invariant cache hit.
[2024-05-24 11:07:00] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-24 11:07:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 11:07:00] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:07:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 11:07:00] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-24 11:07:00] [INFO ] Invariant cache hit.
[2024-05-24 11:07:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-24 11:07:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-24 11:07:00] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND p1 (NOT p0)), false]
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Product exploration explored 100000 steps with 33333 reset in 65 ms.
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 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
[2024-05-24 11:07:01] [INFO ] Invariant cache hit.
[2024-05-24 11:07:01] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 11:07:01] [INFO ] Invariant cache hit.
[2024-05-24 11:07:01] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-24 11:07:01] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Election2020-PT-none-LTLCardinality-12 finished in 5050 ms.
[2024-05-24 11:07:01] [INFO ] Flatten gal took : 6 ms
[2024-05-24 11:07:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-24 11:07:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 38 places, 72 transitions and 144 arcs took 8 ms.
Total runtime 38284 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Election2020-PT-none

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 38
TRANSITIONS: 72
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2209
MODEL NAME: /home/mcc/execution/414/model
38 places, 72 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
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 r157-smll-171636265200211"
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 ;