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-165281572100331.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-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572100331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 6.0K Apr 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 29 14:47 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.4K May 9 08:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 3.5K 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-0010-LTLCardinality-00
FORMULA_NAME Referendum-COL-0010-LTLCardinality-01
FORMULA_NAME Referendum-COL-0010-LTLCardinality-02
FORMULA_NAME Referendum-COL-0010-LTLCardinality-03
FORMULA_NAME Referendum-COL-0010-LTLCardinality-04
FORMULA_NAME Referendum-COL-0010-LTLCardinality-05
FORMULA_NAME Referendum-COL-0010-LTLCardinality-06
FORMULA_NAME Referendum-COL-0010-LTLCardinality-07
FORMULA_NAME Referendum-COL-0010-LTLCardinality-08
FORMULA_NAME Referendum-COL-0010-LTLCardinality-09
FORMULA_NAME Referendum-COL-0010-LTLCardinality-10
FORMULA_NAME Referendum-COL-0010-LTLCardinality-11
FORMULA_NAME Referendum-COL-0010-LTLCardinality-12
FORMULA_NAME Referendum-COL-0010-LTLCardinality-13
FORMULA_NAME Referendum-COL-0010-LTLCardinality-14
FORMULA_NAME Referendum-COL-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653082882462

Running Version 202205111006
[2022-05-20 21:41:23] [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:41:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 21:41:24] [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:41:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 21:41:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 482 ms
[2022-05-20 21:41:24] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 31 PT places and 21.0 transition bindings in 14 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-0010-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:41:24] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2022-05-20 21:41:24] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Referendum-COL-0010-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-LTLCardinality-12 FALSE 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 10009 steps, including 769 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10000 steps, including 312 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 312 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:24] [INFO ] Computed 1 place invariants in 4 ms
[2022-05-20 21:41:25] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2022-05-20 21:41:25] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA Referendum-COL-0010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0010-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 21:41:25] [INFO ] Flatten gal took : 13 ms
[2022-05-20 21:41:25] [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
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]]] introduces in Voters(10) 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 10
[2022-05-20 21:41:25] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 7 ms.
[2022-05-20 21:41:25] [INFO ] Unfolded 10 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 4 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:41:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Dead Transitions using invariants and state equation in 21 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:41:25] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:41:25] [INFO ] Flatten gal took : 1 ms
[2022-05-20 21:41:25] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 51 steps, including 3 resets, run visited all 15 properties in 2 ms. (steps per millisecond=25 )
FORMULA Referendum-COL-0010-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Referendum-COL-0010-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!((G(F(X((X(p0)&&p0)))) U F(p1)))'
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 2 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:41:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2022-05-20 21:41:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p1)]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (LEQ 1 s2) (LEQ s1 s0) (LEQ 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 17 steps with 2 reset in 1 ms.
FORMULA Referendum-COL-0010-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-LTLCardinality-03 finished in 248 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
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:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2022-05-20 21:41:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s2 s1), p1:(LEQ s1 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 11 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0010-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-LTLCardinality-06 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(F(p0) U p1))||X(F(p2))))'
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 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:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:25] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:25] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p0)]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(LEQ 2 s1), p1:(LEQ s0 s3), p0:(LEQ s3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 346 steps with 59 reset in 4 ms.
FORMULA Referendum-COL-0010-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-LTLCardinality-07 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(F((F(p0)||p0))))||X(F(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.
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:41:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:26] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:26] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:26] [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 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s2), p0:(LEQ 1 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 33333 reset in 186 ms.
Product exploration explored 100000 steps with 33333 reset in 115 ms.
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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0010-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0010-LTLCardinality-09 finished in 709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(F((F(p0)&&p1))))||p2))))'
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 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:41:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:26] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:27] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-20 21:41:27] [INFO ] Implicit Places using invariants and state equation in 21 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:41:27] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-20 21:41:27] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s0 s1), p0:(LEQ 2 s1), p1:(GT s2 s0)], 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 8333 reset in 189 ms.
Product exploration explored 100000 steps with 8333 reset in 125 ms.
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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 12 factoid took 592 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 41 steps, including 3 resets, run visited all 5 properties in 1 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 12 factoid took 856 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 213 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-20 21:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 21:41:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:41:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 21:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:29] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:41:29] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:41:29] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-20 21:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:41:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:41:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 21:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:29] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-20 21:41:29] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:41:29] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
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:41:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:29] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:29] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:29] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 12 factoid took 732 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 25 steps, including 1 resets, run visited all 5 properties in 1 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p2)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 12 factoid took 715 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 5 states, 10 edges and 3 AP.
Stuttering acceptance computed with spot in 219 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-20 21:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:32] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-20 21:41:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:41:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 21:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:41:32] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:41:32] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:32] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-20 21:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-20 21:41:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 21:41:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-20 21:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 21:41:32] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-20 21:41:32] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 21:41:32] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8333 reset in 96 ms.
Product exploration explored 100000 steps with 8333 reset in 83 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
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.
[2022-05-20 21:41:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:33] [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.
Product exploration explored 100000 steps with 8333 reset in 136 ms.
Product exploration explored 100000 steps with 8333 reset in 146 ms.
Built C files in :
/tmp/ltsmin11806544583199905742
[2022-05-20 21:41:33] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11806544583199905742
Running compilation step : cd /tmp/ltsmin11806544583199905742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin11806544583199905742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11806544583199905742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7291235078648836242.hoa' '--buchi-type=spotba'
LTSmin run took 237 ms.
FORMULA Referendum-COL-0010-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Referendum-COL-0010-LTLCardinality-11 finished in 6942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(G(((p0 U G(p1)) U p2))))||G(p3)))'
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:41:33] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:33] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:33] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-20 21:41:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:33] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1))]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p2) p1) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(OR p2 p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=3 dest: 4}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p1) p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND p2 p1) (AND p1 p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p3:(LEQ s1 s0), p2:(GT s0 s2), p0:(LEQ 3 s1), p1:(OR (LEQ 3 s1) (LEQ s0 s2))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 503 steps with 41 reset in 5 ms.
FORMULA Referendum-COL-0010-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-LTLCardinality-13 finished in 448 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((X((p0 U p1))||(G(p0)&&!p1))))))'
Support contains 4 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:41:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:34] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:34] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 21:41:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:34] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s1 s2), p0:(LEQ s0 s3)], 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 25790 reset in 102 ms.
Product exploration explored 100000 steps with 25895 reset in 243 ms.
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).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G p0))]
False Knowledge obtained : [(X (X (OR p1 (NOT p0)))), (X (X (NOT (OR p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 3 states, 10 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Referendum-COL-0010-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0010-LTLCardinality-14 finished in 951 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(((p0 U G(p0))&&p1))||G(p2))))'
Support contains 4 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 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:41:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:35] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:35] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 21:41:35] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2022-05-20 21:41:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 21:41:35] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 21:41:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 48 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Referendum-COL-0010-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ s0 s3), p2:(AND (LEQ s0 s3) (LEQ s2 s1))], nbAcceptance=2, 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 1787 steps with 148 reset in 2 ms.
FORMULA Referendum-COL-0010-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0010-LTLCardinality-15 finished in 144 ms.
All properties solved by simple procedures.
Total runtime 11540 ms.

BK_STOP 1653082895887

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.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-0010"
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-0010, 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-165281572100331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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