Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572100355.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Referendum-COL-0050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572100355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.5K Apr 29 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 29 14:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 14:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.9K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1653083045680

Running Version 202205111006
[2022-05-20 21:44:07] [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]
[2022-05-20 21:44:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:44:07] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-20 21:44:07] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:44:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 523 ms
[2022-05-20 21:44:07] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 151 PT places and 101.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA Referendum-COL-0050-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:44:07] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2022-05-20 21:44:07] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-COL-0050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0050-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10016 steps, including 188 resets, run finished after 55 ms. (steps per millisecond=182 ) properties (out of 17) seen :16
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:08] [INFO ] Computed 1 place invariants in 63 ms
[2022-05-20 21:44:08] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-05-20 21:44:08] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Referendum-COL-0050-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:44:08] [INFO ] Flatten gal took : 14 ms
[2022-05-20 21:44:08] [INFO ] Flatten gal took : 2 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Arc [3:1*[10]] contains constants of sort Voters
Arc [3:1*[11]] contains constants of sort Voters
Arc [3:1*[12]] contains constants of sort Voters
Arc [3:1*[13]] contains constants of sort Voters
Arc [3:1*[14]] contains constants of sort Voters
Arc [3:1*[15]] contains constants of sort Voters
Arc [3:1*[16]] contains constants of sort Voters
Arc [3:1*[17]] contains constants of sort Voters
Arc [3:1*[18]] contains constants of sort Voters
Arc [3:1*[19]] contains constants of sort Voters
Arc [3:1*[20]] contains constants of sort Voters
Arc [3:1*[21]] contains constants of sort Voters
Arc [3:1*[22]] contains constants of sort Voters
Arc [3:1*[23]] contains constants of sort Voters
Arc [3:1*[24]] contains constants of sort Voters
Arc [3:1*[25]] contains constants of sort Voters
Arc [3:1*[26]] contains constants of sort Voters
Arc [3:1*[27]] contains constants of sort Voters
Arc [3:1*[28]] contains constants of sort Voters
Arc [3:1*[29]] contains constants of sort Voters
Arc [3:1*[30]] contains constants of sort Voters
Arc [3:1*[31]] contains constants of sort Voters
Arc [3:1*[32]] contains constants of sort Voters
Arc [3:1*[33]] contains constants of sort Voters
Arc [3:1*[34]] contains constants of sort Voters
Arc [3:1*[35]] contains constants of sort Voters
Arc [3:1*[36]] contains constants of sort Voters
Arc [3:1*[37]] contains constants of sort Voters
Arc [3:1*[38]] contains constants of sort Voters
Arc [3:1*[39]] contains constants of sort Voters
Arc [3:1*[40]] contains constants of sort Voters
Arc [3:1*[41]] contains constants of sort Voters
Arc [3:1*[42]] contains constants of sort Voters
Arc [3:1*[43]] contains constants of sort Voters
Arc [3:1*[44]] contains constants of sort Voters
Arc [3:1*[45]] contains constants of sort Voters
Arc [3:1*[46]] contains constants of sort Voters
Arc [3:1*[47]] contains constants of sort Voters
Arc [3:1*[48]] contains constants of sort Voters
Arc [3:1*[49]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]], [3:1*[10]], [3:1*[11]], [3:1*[12]], [3:1*[13]], [3:1*[14]], [3:1*[15]], [3:1*[16]], [3:1*[17]], [3:1*[18]], [3:1*[19]], [3:1*[20]], [3:1*[21]], [3:1*[22]], [3:1*[23]], [3:1*[24]], [3:1*[25]], [3:1*[26]], [3:1*[27]], [3:1*[28]], [3:1*[29]], [3:1*[30]], [3:1*[31]], [3:1*[32]], [3:1*[33]], [3:1*[34]], [3:1*[35]], [3:1*[36]], [3:1*[37]], [3:1*[38]], [3:1*[39]], [3:1*[40]], [3:1*[41]], [3:1*[42]], [3:1*[43]], [3:1*[44]], [3:1*[45]], [3:1*[46]], [3:1*[47]], [3:1*[48]], [3:1*[49]]] introduces in Voters(50) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 50
[2022-05-20 21:44:08] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 8 ms.
[2022-05-20 21:44:08] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 11 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:08] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:08] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2022-05-20 21:44:08] [INFO ] Flatten gal took : 2 ms
[2022-05-20 21:44:08] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:44:08] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 105 steps, including 1 resets, run visited all 15 properties in 3 ms. (steps per millisecond=35 )
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 2 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:08] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:08] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:08] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:44:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 5 ms
[2022-05-20 21:44:09] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2810 reset in 175 ms.
Product exploration explored 100000 steps with 2812 reset in 113 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (X (NOT p0))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0050-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0050-LTLCardinality-01 finished in 785 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!((!G(p0) U p1) U X(p0)))&&G(!p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:09] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:09] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:09] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR p1 p0), (OR p0 p1), true, (OR p0 p1), p1]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(LEQ 3 s2), p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 Referendum-COL-0050-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-02 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0) U X(p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:09] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:09] [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.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:09] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1 s2), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33229 reset in 124 ms.
Product exploration explored 100000 steps with 33355 reset in 128 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 401 ms. Reduced automaton from 5 states, 10 edges and 2 AP to 5 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (AND p0 (NOT p1)), (NOT p1), true, (NOT p0)]
Incomplete random walk after 10016 steps, including 188 resets, run finished after 7 ms. (steps per millisecond=1430 ) properties (out of 5) seen :4
Finished Best-First random walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND p0 (NOT p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 10 factoid took 179 ms. Reduced automaton from 5 states, 12 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-COL-0050-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0050-LTLCardinality-03 finished in 1237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(X(p0)))||G(p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 0 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 4 ms
[2022-05-20 21:44:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=p1, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(LEQ 1 s1), p1:(LEQ 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-04 finished in 330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(G(p0))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2022-05-20 21:44:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-05 finished in 128 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U (!(F(X(G(p1)))&&(p2 U p0))&&p3)))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:11] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), true, (NOT p0), (NOT p1), (AND (NOT p1) p3 p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p3 p0) (AND p3 p2)), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p3 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(LEQ 1 s0), p0:(LEQ s1 s0), p2:(LEQ 2 s2), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 1 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-06 finished in 229 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((p0 U X(p0))))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2022-05-20 21:44:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:11] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:11] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9738 reset in 129 ms.
Product exploration explored 100000 steps with 9833 reset in 150 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 (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=51 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 2 rows 2 cols
[2022-05-20 21:44:13] [INFO ] Computed 0 place invariants in 0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA Referendum-COL-0050-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0050-LTLCardinality-07 finished in 1410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:13] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:13] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:13] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-08 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U G(X((F(p2)||G(p3)||p1))))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:13] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:13] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:44:13] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:13] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR p2 p1 p3), (OR p3 p1 p2), (OR p1 p3 p2), p2, p3]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=p3, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s0 s2), p1:(OR (LEQ s0 s2) (LEQ s0 s1)), p2:(LEQ s0 s1), p3:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-10 finished in 444 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:14] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-20 21:44:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:44:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:44:14] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT s3 s1) (GT s1 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 131 steps with 12 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-11 finished in 136 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:14] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:14] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 21:44:14] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2022-05-20 21:44:14] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 21:44:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions, in 1 iterations. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0050-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0050-LTLCardinality-15 finished in 245 ms.
All properties solved by simple procedures.
Total runtime 7168 ms.

BK_STOP 1653083054942

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-COL-0050"
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 Referendum-COL-0050, 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 r186-tajo-165281572100355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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