Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.7K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.7K May 11 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 11 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 11 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 115K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Election2020-PT-none-00
FORMULA_NAME Election2020-PT-none-01
FORMULA_NAME Election2020-PT-none-02
FORMULA_NAME Election2020-PT-none-03
FORMULA_NAME Election2020-PT-none-04
FORMULA_NAME Election2020-PT-none-05
FORMULA_NAME Election2020-PT-none-06
FORMULA_NAME Election2020-PT-none-07
FORMULA_NAME Election2020-PT-none-08
FORMULA_NAME Election2020-PT-none-09
FORMULA_NAME Election2020-PT-none-10
FORMULA_NAME Election2020-PT-none-11
FORMULA_NAME Election2020-PT-none-12
FORMULA_NAME Election2020-PT-none-13
FORMULA_NAME Election2020-PT-none-14
FORMULA_NAME Election2020-PT-none-15

=== Now, execution of the tool begins

BK_START 1621268704833

Running Version 0
[2021-05-17 16:25:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 16:25:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:25:06] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-17 16:25:06] [INFO ] Transformed 53 places.
[2021-05-17 16:25:06] [INFO ] Transformed 102 transitions.
[2021-05-17 16:25:06] [INFO ] Parsed PT model containing 53 places and 102 transitions in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:25:06] [INFO ] Initial state test concluded for 4 properties.
FORMULA Election2020-PT-none-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 53 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 80
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 80
Applied a total of 22 rules in 14 ms. Remains 42 /53 variables (removed 11) and now considering 80/102 (removed 22) transitions.
// Phase 1: matrix 80 rows 42 cols
[2021-05-17 16:25:06] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-17 16:25:06] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
// Phase 1: matrix 80 rows 42 cols
[2021-05-17 16:25:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-17 16:25:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 80 rows 42 cols
[2021-05-17 16:25:06] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-17 16:25:06] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 80 rows 42 cols
[2021-05-17 16:25:06] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-17 16:25:06] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/53 places, 80/102 transitions.
[2021-05-17 16:25:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 16:25:07] [INFO ] Flatten gal took : 27 ms
FORMULA Election2020-PT-none-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:25:07] [INFO ] Flatten gal took : 9 ms
[2021-05-17 16:25:07] [INFO ] Input system was already deterministic with 80 transitions.
Finished random walk after 821 steps, including 12 resets, run visited all 23 properties in 11 ms. (steps per millisecond=74 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Graph (complete) has 80 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 40 transition count 40
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 21 transition count 21
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 99 place count 1 transition count 1
Applied a total of 99 rules in 17 ms. Remains 1 /42 variables (removed 41) and now considering 1/80 (removed 79) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:07] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:07] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:07] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 16:25:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-17 16:25:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:07] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/42 places, 1/80 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 154 ms.
Product exploration explored 100000 steps with 50000 reset in 108 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
[2021-05-17 16:25:08] [INFO ] Flatten gal took : 1 ms
[2021-05-17 16:25:08] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:25:08] [INFO ] Time to serialize gal into /tmp/LTL13973339718524578702.gal : 0 ms
[2021-05-17 16:25:08] [INFO ] Time to serialize properties into /tmp/LTL17881762908060771631.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL13973339718524578702.gal, -t, CGAL, -LTL, /tmp/LTL17881762908060771631.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL13973339718524578702.gal -t CGAL -LTL /tmp/LTL17881762908060771631.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(MO<1)"))))
Formula 0 simplified : !FG"(MO<1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.013402,16376,1,0,6,8,24,5,18,10,26
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Election2020-PT-none-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Election2020-PT-none-00 finished in 927 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 40 transition count 40
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 23 transition count 23
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 23 transition count 23
Applied a total of 76 rules in 3 ms. Remains 23 /42 variables (removed 19) and now considering 23/80 (removed 57) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/42 places, 23/80 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 3 s7), p0:(LEQ s20 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA Election2020-PT-none-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-01 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Graph (complete) has 80 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 40 transition count 40
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 23 transition count 23
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 23 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 22 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 3 transition count 3
Applied a total of 95 rules in 9 ms. Remains 3 /42 variables (removed 39) and now considering 3/80 (removed 77) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-17 16:25:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/42 places, 3/80 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s1), p1:(AND (GT 1 s1) (GT s2 s0))], 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 15 steps with 3 reset in 1 ms.
FORMULA Election2020-PT-none-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-04 finished in 137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 80
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 21 place count 21 transition count 40
Iterating global reduction 1 with 20 rules applied. Total rules applied 41 place count 21 transition count 40
Applied a total of 41 rules in 3 ms. Remains 21 /42 variables (removed 21) and now considering 40/80 (removed 40) transitions.
// Phase 1: matrix 40 rows 21 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 40 rows 21 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 21 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/42 places, 40/80 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 82 steps with 12 reset in 1 ms.
FORMULA Election2020-PT-none-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-06 finished in 145 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p0&&F(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Graph (complete) has 80 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 40 transition count 40
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 59 place count 22 transition count 22
Iterating global reduction 1 with 18 rules applied. Total rules applied 77 place count 22 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 4 transition count 4
Applied a total of 95 rules in 7 ms. Remains 4 /42 variables (removed 38) and now considering 4/80 (removed 76) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-17 16:25:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/42 places, 4/80 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(GT s1 s0), p0:(GT s3 s2)], nbAcceptance=2, 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 4 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-07 finished in 137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Graph (complete) has 80 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 40 transition count 40
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 60 place count 21 transition count 21
Iterating global reduction 1 with 19 rules applied. Total rules applied 79 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 2 transition count 2
Applied a total of 98 rules in 10 ms. Remains 2 /42 variables (removed 40) and now considering 2/80 (removed 78) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-17 16:25:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-17 16:25:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:08] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/42 places, 2/80 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Election2020-PT-none-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14285 reset in 91 ms.
Product exploration explored 100000 steps with 14285 reset in 153 ms.
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 : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA Election2020-PT-none-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Election2020-PT-none-08 finished in 381 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0&&F(p1)) U (G((p0&&F(p1)))||(p0&&F(p1)&&G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Graph (complete) has 80 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 40 transition count 40
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 23 transition count 23
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 23 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 22 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 21 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 18 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 81 place count 17 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 82 place count 16 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 15 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 14 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 85 place count 13 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 12 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 11 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 10 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 89 place count 9 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 7 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 6 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 93 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 4 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 3 transition count 3
Applied a total of 95 rules in 12 ms. Remains 3 /42 variables (removed 39) and now considering 3/80 (removed 77) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:09] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:09] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:09] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-17 16:25:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-17 16:25:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:09] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/42 places, 3/80 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : Election2020-PT-none-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s2), p2:(GT 1 s0), p1:(GT 2 s1)], nbAcceptance=2, 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 25526 reset in 80 ms.
Product exploration explored 100000 steps with 25522 reset in 81 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (NOT p0), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 25527 reset in 64 ms.
Product exploration explored 100000 steps with 25525 reset in 85 ms.
[2021-05-17 16:25:09] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:25:09] [INFO ] Flatten gal took : 0 ms
[2021-05-17 16:25:09] [INFO ] Time to serialize gal into /tmp/LTL2608861315490176162.gal : 0 ms
[2021-05-17 16:25:09] [INFO ] Time to serialize properties into /tmp/LTL15973129882997210987.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2608861315490176162.gal, -t, CGAL, -LTL, /tmp/LTL15973129882997210987.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2608861315490176162.gal -t CGAL -LTL /tmp/LTL15973129882997210987.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((("(WI<2)")&&(F("(OR<2)")))U((G(("(WI<2)")&&(F("(OR<2)"))))||((("(WI<2)")&&(F("(OR<2)")))&&(G("(DE<1)")))))))
Formula 0 simplified : !F(("(WI<2)" & F"(OR<2)") U (G("(WI<2)" & F"(OR<2)") | ("(WI<2)" & F"(OR<2)" & G"(DE<1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
8 unique states visited
0 strongly connected components in search stack
14 transitions explored
5 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.011131,17796,1,0,22,62,53,18,67,96,108
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Election2020-PT-none-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Election2020-PT-none-10 finished in 845 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 40 transition count 40
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 24 transition count 24
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 24 transition count 24
Applied a total of 74 rules in 1 ms. Remains 24 /42 variables (removed 18) and now considering 24/80 (removed 56) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/42 places, 24/80 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Election2020-PT-none-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s23 s3), p0:(LEQ s15 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-11 finished in 198 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 40 transition count 40
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 61 place count 21 transition count 21
Iterating global reduction 1 with 19 rules applied. Total rules applied 80 place count 21 transition count 21
Applied a total of 80 rules in 1 ms. Remains 21 /42 variables (removed 21) and now considering 21/80 (removed 59) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 21 rows 21 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/42 places, 21/80 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Election2020-PT-none-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s19 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-12 finished in 164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(G(p1)&&X(X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 40 transition count 40
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 24 transition count 24
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 24 transition count 24
Applied a total of 74 rules in 16 ms. Remains 24 /42 variables (removed 18) and now considering 24/80 (removed 56) transitions.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 24 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/42 places, 24/80 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), true]
Running random walk in product with property : Election2020-PT-none-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(LEQ s16 s1), p0:(GT 3 s7), p2:(OR (GT 2 s5) (GT 3 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-13 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||G(F(p1))))&&F((!p0||X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 41 transition count 80
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 24 transition count 46
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 24 transition count 46
Applied a total of 35 rules in 2 ms. Remains 24 /42 variables (removed 18) and now considering 46/80 (removed 34) transitions.
// Phase 1: matrix 46 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 46 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 46 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 46 rows 24 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/42 places, 46/80 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND p0 p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Election2020-PT-none-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s7 s23), p1:(LEQ s14 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 2 reset in 0 ms.
FORMULA Election2020-PT-none-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-14 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)&&F(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 42/42 places, 80/80 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 40 transition count 40
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 59 place count 23 transition count 23
Iterating global reduction 1 with 17 rules applied. Total rules applied 76 place count 23 transition count 23
Applied a total of 76 rules in 1 ms. Remains 23 /42 variables (removed 19) and now considering 23/80 (removed 57) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 23 cols
[2021-05-17 16:25:10] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-17 16:25:10] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/42 places, 23/80 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Election2020-PT-none-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 s10), p1:(GT 2 s14), p2:(GT 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Election2020-PT-none-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Election2020-PT-none-15 finished in 226 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621268712380

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Election2020-PT-none"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Election2020-PT-none, examination is 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 r292-tall-162124155900092"
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 ;