Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662338800563.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Referendum-COL-0500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338800563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K Apr 12 01:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 11 21:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 22K May 18 16:43 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-0500-LTLCardinality-00
FORMULA_NAME Referendum-COL-0500-LTLCardinality-01
FORMULA_NAME Referendum-COL-0500-LTLCardinality-02
FORMULA_NAME Referendum-COL-0500-LTLCardinality-03
FORMULA_NAME Referendum-COL-0500-LTLCardinality-04
FORMULA_NAME Referendum-COL-0500-LTLCardinality-05
FORMULA_NAME Referendum-COL-0500-LTLCardinality-06
FORMULA_NAME Referendum-COL-0500-LTLCardinality-07
FORMULA_NAME Referendum-COL-0500-LTLCardinality-08
FORMULA_NAME Referendum-COL-0500-LTLCardinality-09
FORMULA_NAME Referendum-COL-0500-LTLCardinality-10
FORMULA_NAME Referendum-COL-0500-LTLCardinality-11
FORMULA_NAME Referendum-COL-0500-LTLCardinality-12
FORMULA_NAME Referendum-COL-0500-LTLCardinality-13
FORMULA_NAME Referendum-COL-0500-LTLCardinality-14
FORMULA_NAME Referendum-COL-0500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717261727173

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:08:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:08:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:08:48] [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.
[2024-06-01 17:08:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:08:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2024-06-01 17:08:49] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 1501 PT places and 1001.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:08:49] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2024-06-01 17:08:49] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-COL-0500-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0500-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0500-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0500-LTLCardinality-08 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).
RANDOM walk for 40236 steps (76 resets) in 113 ms. (352 steps per ms) remains 4/18 properties
BEST_FIRST walk for 40000 steps (24 resets) in 592 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 588 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (24 resets) in 387 ms. (103 steps per ms) remains 4/4 properties
// Phase 1: matrix 3 rows 4 cols
[2024-06-01 17:08:49] [INFO ] Computed 1 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 2 solved, 2 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 4/7 variables, and 1 constraints, problems are : Problem set: 4 solved, 0 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 291ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA Referendum-COL-0500-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:08:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 12 ms
FORMULA Referendum-COL-0500-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 1 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
Arc [3:1*[50]] contains constants of sort Voters
Arc [3:1*[51]] contains constants of sort Voters
Arc [3:1*[52]] contains constants of sort Voters
Arc [3:1*[53]] contains constants of sort Voters
Arc [3:1*[54]] contains constants of sort Voters
Arc [3:1*[55]] contains constants of sort Voters
Arc [3:1*[56]] contains constants of sort Voters
Arc [3:1*[57]] contains constants of sort Voters
Arc [3:1*[58]] contains constants of sort Voters
Arc [3:1*[59]] contains constants of sort Voters
Arc [3:1*[60]] contains constants of sort Voters
Arc [3:1*[61]] contains constants of sort Voters
Arc [3:1*[62]] contains constants of sort Voters
Arc [3:1*[63]] contains constants of sort Voters
Arc [3:1*[64]] contains constants of sort Voters
Arc [3:1*[65]] contains constants of sort Voters
Arc [3:1*[66]] contains constants of sort Voters
Arc [3:1*[67]] contains constants of sort Voters
Arc [3:1*[68]] contains constants of sort Voters
Arc [3:1*[69]] contains constants of sort Voters
Arc [3:1*[70]] contains constants of sort Voters
Arc [3:1*[71]] contains constants of sort Voters
Arc [3:1*[72]] contains constants of sort Voters
Arc [3:1*[73]] contains constants of sort Voters
Arc [3:1*[74]] contains constants of sort Voters
Arc [3:1*[75]] contains constants of sort Voters
Arc [3:1*[76]] contains constants of sort Voters
Arc [3:1*[77]] contains constants of sort Voters
Arc [3:1*[78]] contains constants of sort Voters
Arc [3:1*[79]] contains constants of sort Voters
Arc [3:1*[80]] contains constants of sort Voters
Arc [3:1*[81]] contains constants of sort Voters
Arc [3:1*[82]] contains constants of sort Voters
Arc [3:1*[83]] contains constants of sort Voters
Arc [3:1*[84]] contains constants of sort Voters
Arc [3:1*[85]] contains constants of sort Voters
Arc [3:1*[86]] contains constants of sort Voters
Arc [3:1*[87]] contains constants of sort Voters
Arc [3:1*[88]] contains constants of sort Voters
Arc [3:1*[89]] contains constants of sort Voters
Arc [3:1*[90]] contains constants of sort Voters
Arc [3:1*[91]] contains constants of sort Voters
Arc [3:1*[92]] contains constants of sort Voters
Arc [3:1*[93]] contains constants of sort Voters
Arc [3:1*[94]] contains constants of sort Voters
Arc [3:1*[95]] contains constants of sort Voters
Arc [3:1*[96]] contains constants of sort Voters
Arc [3:1*[97]] contains constants of sort Voters
Arc [3:1*[98]] contains constants of sort Voters
Arc [3:1*[99]] contains constants of sort Voters
Arc [3:1*[100]] contains constants of sort Voters
Arc [3:1*[101]] contains constants of sort Voters
Arc [3:1*[102]] contains constants of sort Voters
Arc [3:1*[103]] contains constants of sort Voters
Arc [3:1*[104]] contains constants of sort Voters
Arc [3:1*[105]] contains constants of sort Voters
Arc [3:1*[106]] contains constants of sort Voters
Arc [3:1*[107]] contains constants of sort Voters
Arc [3:1*[108]] contains constants of sort Voters
Arc [3:1*[109]] contains constants of sort Voters
Arc [3:1*[110]] contains constants of sort Voters
Arc [3:1*[111]] contains constants of sort Voters
Arc [3:1*[112]] contains constants of sort Voters
Arc [3:1*[113]] contains constants of sort Voters
Arc [3:1*[114]] contains constants of sort Voters
Arc [3:1*[115]] contains constants of sort Voters
Arc [3:1*[116]] contains constants of sort Voters
Arc [3:1*[117]] contains constants of sort Voters
Arc [3:1*[118]] contains constants of sort Voters
Arc [3:1*[119]] contains constants of sort Voters
Arc [3:1*[120]] contains constants of sort Voters
Arc [3:1*[121]] contains constants of sort Voters
Arc [3:1*[122]] contains constants of sort Voters
Arc [3:1*[123]] contains constants of sort Voters
Arc [3:1*[124]] contains constants of sort Voters
Arc [3:1*[125]] contains constants of sort Voters
Arc [3:1*[126]] contains constants of sort Voters
Arc [3:1*[127]] contains constants of sort Voters
Arc [3:1*[128]] contains constants of sort Voters
Arc [3:1*[129]] contains constants of sort Voters
Arc [3:1*[130]] contains constants of sort Voters
Arc [3:1*[131]] contains constants of sort Voters
Arc [3:1*[132]] contains constants of sort Voters
Arc [3:1*[133]] contains constants of sort Voters
Arc [3:1*[134]] contains constants of sort Voters
Arc [3:1*[135]] contains constants of sort Voters
Arc [3:1*[136]] contains constants of sort Voters
Arc [3:1*[137]] contains constants of sort Voters
Arc [3:1*[138]] contains constants of sort Voters
Arc [3:1*[139]] contains constants of sort Voters
Arc [3:1*[140]] contains constants of sort Voters
Arc [3:1*[141]] contains constants of sort Voters
Arc [3:1*[142]] contains constants of sort Voters
Arc [3:1*[143]] contains constants of sort Voters
Arc [3:1*[144]] contains constants of sort Voters
Arc [3:1*[145]] contains constants of sort Voters
Arc [3:1*[146]] contains constants of sort Voters
Arc [3:1*[147]] contains constants of sort Voters
Arc [3:1*[148]] contains constants of sort Voters
Arc [3:1*[149]] contains constants of sort Voters
Arc [3:1*[150]] contains constants of sort Voters
Arc [3:1*[151]] contains constants of sort Voters
Arc [3:1*[152]] contains constants of sort Voters
Arc [3:1*[153]] contains constants of sort Voters
Arc [3:1*[154]] contains constants of sort Voters
Arc [3:1*[155]] contains constants of sort Voters
Arc [3:1*[156]] contains constants of sort Voters
Arc [3:1*[157]] contains constants of sort Voters
Arc [3:1*[158]] contains constants of sort Voters
Arc [3:1*[159]] contains constants of sort Voters
Arc [3:1*[160]] contains constants of sort Voters
Arc [3:1*[161]] contains constants of sort Voters
Arc [3:1*[162]] contains constants of sort Voters
Arc [3:1*[163]] contains constants of sort Voters
Arc [3:1*[164]] contains constants of sort Voters
Arc [3:1*[165]] contains constants of sort Voters
Arc [3:1*[166]] contains constants of sort Voters
Arc [3:1*[167]] contains constants of sort Voters
Arc [3:1*[168]] contains constants of sort Voters
Arc [3:1*[169]] contains constants of sort Voters
Arc [3:1*[170]] contains constants of sort Voters
Arc [3:1*[171]] contains constants of sort Voters
Arc [3:1*[172]] contains constants of sort Voters
Arc [3:1*[173]] contains constants of sort Voters
Arc [3:1*[174]] contains constants of sort Voters
Arc [3:1*[175]] contains constants of sort Voters
Arc [3:1*[176]] contains constants of sort Voters
Arc [3:1*[177]] contains constants of sort Voters
Arc [3:1*[178]] contains constants of sort Voters
Arc [3:1*[179]] contains constants of sort Voters
Arc [3:1*[180]] contains constants of sort Voters
Arc [3:1*[181]] contains constants of sort Voters
Arc [3:1*[182]] contains constants of sort Voters
Arc [3:1*[183]] contains constants of sort Voters
Arc [3:1*[184]] contains constants of sort Voters
Arc [3:1*[185]] contains constants of sort Voters
Arc [3:1*[186]] contains constants of sort Voters
Arc [3:1*[187]] contains constants of sort Voters
Arc [3:1*[188]] contains constants of sort Voters
Arc [3:1*[189]] contains constants of sort Voters
Arc [3:1*[190]] contains constants of sort Voters
Arc [3:1*[191]] contains constants of sort Voters
Arc [3:1*[192]] contains constants of sort Voters
Arc [3:1*[193]] contains constants of sort Voters
Arc [3:1*[194]] contains constants of sort Voters
Arc [3:1*[195]] contains constants of sort Voters
Arc [3:1*[196]] contains constants of sort Voters
Arc [3:1*[197]] contains constants of sort Voters
Arc [3:1*[198]] contains constants of sort Voters
Arc [3:1*[199]] contains constants of sort Voters
Arc [3:1*[200]] contains constants of sort Voters
Arc [3:1*[201]] contains constants of sort Voters
Arc [3:1*[202]] contains constants of sort Voters
Arc [3:1*[203]] contains constants of sort Voters
Arc [3:1*[204]] contains constants of sort Voters
Arc [3:1*[205]] contains constants of sort Voters
Arc [3:1*[206]] contains constants of sort Voters
Arc [3:1*[207]] contains constants of sort Voters
Arc [3:1*[208]] contains constants of sort Voters
Arc [3:1*[209]] contains constants of sort Voters
Arc [3:1*[210]] contains constants of sort Voters
Arc [3:1*[211]] contains constants of sort Voters
Arc [3:1*[212]] contains constants of sort Voters
Arc [3:1*[213]] contains constants of sort Voters
Arc [3:1*[214]] contains constants of sort Voters
Arc [3:1*[215]] contains constants of sort Voters
Arc [3:1*[216]] contains constants of sort Voters
Arc [3:1*[217]] contains constants of sort Voters
Arc [3:1*[218]] contains constants of sort Voters
Arc [3:1*[219]] contains constants of sort Voters
Arc [3:1*[220]] contains constants of sort Voters
Arc [3:1*[221]] contains constants of sort Voters
Arc [3:1*[222]] contains constants of sort Voters
Arc [3:1*[223]] contains constants of sort Voters
Arc [3:1*[224]] contains constants of sort Voters
Arc [3:1*[225]] contains constants of sort Voters
Arc [3:1*[226]] contains constants of sort Voters
Arc [3:1*[227]] contains constants of sort Voters
Arc [3:1*[228]] contains constants of sort Voters
Arc [3:1*[229]] contains constants of sort Voters
Arc [3:1*[230]] contains constants of sort Voters
Arc [3:1*[231]] contains constants of sort Voters
Arc [3:1*[232]] contains constants of sort Voters
Arc [3:1*[233]] contains constants of sort Voters
Arc [3:1*[234]] contains constants of sort Voters
Arc [3:1*[235]] contains constants of sort Voters
Arc [3:1*[236]] contains constants of sort Voters
Arc [3:1*[237]] contains constants of sort Voters
Arc [3:1*[238]] contains constants of sort Voters
Arc [3:1*[239]] contains constants of sort Voters
Arc [3:1*[240]] contains constants of sort Voters
Arc [3:1*[241]] contains constants of sort Voters
Arc [3:1*[242]] contains constants of sort Voters
Arc [3:1*[243]] contains constants of sort Voters
Arc [3:1*[244]] contains constants of sort Voters
Arc [3:1*[245]] contains constants of sort Voters
Arc [3:1*[246]] contains constants of sort Voters
Arc [3:1*[247]] contains constants of sort Voters
Arc [3:1*[248]] contains constants of sort Voters
Arc [3:1*[249]] contains constants of sort Voters
Arc [3:1*[250]] contains constants of sort Voters
Arc [3:1*[251]] contains constants of sort Voters
Arc [3:1*[252]] contains constants of sort Voters
Arc [3:1*[253]] contains constants of sort Voters
Arc [3:1*[254]] contains constants of sort Voters
Arc [3:1*[255]] contains constants of sort Voters
Arc [3:1*[256]] contains constants of sort Voters
Arc [3:1*[257]] contains constants of sort Voters
Arc [3:1*[258]] contains constants of sort Voters
Arc [3:1*[259]] contains constants of sort Voters
Arc [3:1*[260]] contains constants of sort Voters
Arc [3:1*[261]] contains constants of sort Voters
Arc [3:1*[262]] contains constants of sort Voters
Arc [3:1*[263]] contains constants of sort Voters
Arc [3:1*[264]] contains constants of sort Voters
Arc [3:1*[265]] contains constants of sort Voters
Arc [3:1*[266]] contains constants of sort Voters
Arc [3:1*[267]] contains constants of sort Voters
Arc [3:1*[268]] contains constants of sort Voters
Arc [3:1*[269]] contains constants of sort Voters
Arc [3:1*[270]] contains constants of sort Voters
Arc [3:1*[271]] contains constants of sort Voters
Arc [3:1*[272]] contains constants of sort Voters
Arc [3:1*[273]] contains constants of sort Voters
Arc [3:1*[274]] contains constants of sort Voters
Arc [3:1*[275]] contains constants of sort Voters
Arc [3:1*[276]] contains constants of sort Voters
Arc [3:1*[277]] contains constants of sort Voters
Arc [3:1*[278]] contains constants of sort Voters
Arc [3:1*[279]] contains constants of sort Voters
Arc [3:1*[280]] contains constants of sort Voters
Arc [3:1*[281]] contains constants of sort Voters
Arc [3:1*[282]] contains constants of sort Voters
Arc [3:1*[283]] contains constants of sort Voters
Arc [3:1*[284]] contains constants of sort Voters
Arc [3:1*[285]] contains constants of sort Voters
Arc [3:1*[286]] contains constants of sort Voters
Arc [3:1*[287]] contains constants of sort Voters
Arc [3:1*[288]] contains constants of sort Voters
Arc [3:1*[289]] contains constants of sort Voters
Arc [3:1*[290]] contains constants of sort Voters
Arc [3:1*[291]] contains constants of sort Voters
Arc [3:1*[292]] contains constants of sort Voters
Arc [3:1*[293]] contains constants of sort Voters
Arc [3:1*[294]] contains constants of sort Voters
Arc [3:1*[295]] contains constants of sort Voters
Arc [3:1*[296]] contains constants of sort Voters
Arc [3:1*[297]] contains constants of sort Voters
Arc [3:1*[298]] contains constants of sort Voters
Arc [3:1*[299]] contains constants of sort Voters
Arc [3:1*[300]] contains constants of sort Voters
Arc [3:1*[301]] contains constants of sort Voters
Arc [3:1*[302]] contains constants of sort Voters
Arc [3:1*[303]] contains constants of sort Voters
Arc [3:1*[304]] contains constants of sort Voters
Arc [3:1*[305]] contains constants of sort Voters
Arc [3:1*[306]] contains constants of sort Voters
Arc [3:1*[307]] contains constants of sort Voters
Arc [3:1*[308]] contains constants of sort Voters
Arc [3:1*[309]] contains constants of sort Voters
Arc [3:1*[310]] contains constants of sort Voters
Arc [3:1*[311]] contains constants of sort Voters
Arc [3:1*[312]] contains constants of sort Voters
Arc [3:1*[313]] contains constants of sort Voters
Arc [3:1*[314]] contains constants of sort Voters
Arc [3:1*[315]] contains constants of sort Voters
Arc [3:1*[316]] contains constants of sort Voters
Arc [3:1*[317]] contains constants of sort Voters
Arc [3:1*[318]] contains constants of sort Voters
Arc [3:1*[319]] contains constants of sort Voters
Arc [3:1*[320]] contains constants of sort Voters
Arc [3:1*[321]] contains constants of sort Voters
Arc [3:1*[322]] contains constants of sort Voters
Arc [3:1*[323]] contains constants of sort Voters
Arc [3:1*[324]] contains constants of sort Voters
Arc [3:1*[325]] contains constants of sort Voters
Arc [3:1*[326]] contains constants of sort Voters
Arc [3:1*[327]] contains constants of sort Voters
Arc [3:1*[328]] contains constants of sort Voters
Arc [3:1*[329]] contains constants of sort Voters
Arc [3:1*[330]] contains constants of sort Voters
Arc [3:1*[331]] contains constants of sort Voters
Arc [3:1*[332]] contains constants of sort Voters
Arc [3:1*[333]] contains constants of sort Voters
Arc [3:1*[334]] contains constants of sort Voters
Arc [3:1*[335]] contains constants of sort Voters
Arc [3:1*[336]] contains constants of sort Voters
Arc [3:1*[337]] contains constants of sort Voters
Arc [3:1*[338]] contains constants of sort Voters
Arc [3:1*[339]] contains constants of sort Voters
Arc [3:1*[340]] contains constants of sort Voters
Arc [3:1*[341]] contains constants of sort Voters
Arc [3:1*[342]] contains constants of sort Voters
Arc [3:1*[343]] contains constants of sort Voters
Arc [3:1*[344]] contains constants of sort Voters
Arc [3:1*[345]] contains constants of sort Voters
Arc [3:1*[346]] contains constants of sort Voters
Arc [3:1*[347]] contains constants of sort Voters
Arc [3:1*[348]] contains constants of sort Voters
Arc [3:1*[349]] contains constants of sort Voters
Arc [3:1*[350]] contains constants of sort Voters
Arc [3:1*[351]] contains constants of sort Voters
Arc [3:1*[352]] contains constants of sort Voters
Arc [3:1*[353]] contains constants of sort Voters
Arc [3:1*[354]] contains constants of sort Voters
Arc [3:1*[355]] contains constants of sort Voters
Arc [3:1*[356]] contains constants of sort Voters
Arc [3:1*[357]] contains constants of sort Voters
Arc [3:1*[358]] contains constants of sort Voters
Arc [3:1*[359]] contains constants of sort Voters
Arc [3:1*[360]] contains constants of sort Voters
Arc [3:1*[361]] contains constants of sort Voters
Arc [3:1*[362]] contains constants of sort Voters
Arc [3:1*[363]] contains constants of sort Voters
Arc [3:1*[364]] contains constants of sort Voters
Arc [3:1*[365]] contains constants of sort Voters
Arc [3:1*[366]] contains constants of sort Voters
Arc [3:1*[367]] contains constants of sort Voters
Arc [3:1*[368]] contains constants of sort Voters
Arc [3:1*[369]] contains constants of sort Voters
Arc [3:1*[370]] contains constants of sort Voters
Arc [3:1*[371]] contains constants of sort Voters
Arc [3:1*[372]] contains constants of sort Voters
Arc [3:1*[373]] contains constants of sort Voters
Arc [3:1*[374]] contains constants of sort Voters
Arc [3:1*[375]] contains constants of sort Voters
Arc [3:1*[376]] contains constants of sort Voters
Arc [3:1*[377]] contains constants of sort Voters
Arc [3:1*[378]] contains constants of sort Voters
Arc [3:1*[379]] contains constants of sort Voters
Arc [3:1*[380]] contains constants of sort Voters
Arc [3:1*[381]] contains constants of sort Voters
Arc [3:1*[382]] contains constants of sort Voters
Arc [3:1*[383]] contains constants of sort Voters
Arc [3:1*[384]] contains constants of sort Voters
Arc [3:1*[385]] contains constants of sort Voters
Arc [3:1*[386]] contains constants of sort Voters
Arc [3:1*[387]] contains constants of sort Voters
Arc [3:1*[388]] contains constants of sort Voters
Arc [3:1*[389]] contains constants of sort Voters
Arc [3:1*[390]] contains constants of sort Voters
Arc [3:1*[391]] contains constants of sort Voters
Arc [3:1*[392]] contains constants of sort Voters
Arc [3:1*[393]] contains constants of sort Voters
Arc [3:1*[394]] contains constants of sort Voters
Arc [3:1*[395]] contains constants of sort Voters
Arc [3:1*[396]] contains constants of sort Voters
Arc [3:1*[397]] contains constants of sort Voters
Arc [3:1*[398]] contains constants of sort Voters
Arc [3:1*[399]] contains constants of sort Voters
Arc [3:1*[400]] contains constants of sort Voters
Arc [3:1*[401]] contains constants of sort Voters
Arc [3:1*[402]] contains constants of sort Voters
Arc [3:1*[403]] contains constants of sort Voters
Arc [3:1*[404]] contains constants of sort Voters
Arc [3:1*[405]] contains constants of sort Voters
Arc [3:1*[406]] contains constants of sort Voters
Arc [3:1*[407]] contains constants of sort Voters
Arc [3:1*[408]] contains constants of sort Voters
Arc [3:1*[409]] contains constants of sort Voters
Arc [3:1*[410]] contains constants of sort Voters
Arc [3:1*[411]] contains constants of sort Voters
Arc [3:1*[412]] contains constants of sort Voters
Arc [3:1*[413]] contains constants of sort Voters
Arc [3:1*[414]] contains constants of sort Voters
Arc [3:1*[415]] contains constants of sort Voters
Arc [3:1*[416]] contains constants of sort Voters
Arc [3:1*[417]] contains constants of sort Voters
Arc [3:1*[418]] contains constants of sort Voters
Arc [3:1*[419]] contains constants of sort Voters
Arc [3:1*[420]] contains constants of sort Voters
Arc [3:1*[421]] contains constants of sort Voters
Arc [3:1*[422]] contains constants of sort Voters
Arc [3:1*[423]] contains constants of sort Voters
Arc [3:1*[424]] contains constants of sort Voters
Arc [3:1*[425]] contains constants of sort Voters
Arc [3:1*[426]] contains constants of sort Voters
Arc [3:1*[427]] contains constants of sort Voters
Arc [3:1*[428]] contains constants of sort Voters
Arc [3:1*[429]] contains constants of sort Voters
Arc [3:1*[430]] contains constants of sort Voters
Arc [3:1*[431]] contains constants of sort Voters
Arc [3:1*[432]] contains constants of sort Voters
Arc [3:1*[433]] contains constants of sort Voters
Arc [3:1*[434]] contains constants of sort Voters
Arc [3:1*[435]] contains constants of sort Voters
Arc [3:1*[436]] contains constants of sort Voters
Arc [3:1*[437]] contains constants of sort Voters
Arc [3:1*[438]] contains constants of sort Voters
Arc [3:1*[439]] contains constants of sort Voters
Arc [3:1*[440]] contains constants of sort Voters
Arc [3:1*[441]] contains constants of sort Voters
Arc [3:1*[442]] contains constants of sort Voters
Arc [3:1*[443]] contains constants of sort Voters
Arc [3:1*[444]] contains constants of sort Voters
Arc [3:1*[445]] contains constants of sort Voters
Arc [3:1*[446]] contains constants of sort Voters
Arc [3:1*[447]] contains constants of sort Voters
Arc [3:1*[448]] contains constants of sort Voters
Arc [3:1*[449]] contains constants of sort Voters
Arc [3:1*[450]] contains constants of sort Voters
Arc [3:1*[451]] contains constants of sort Voters
Arc [3:1*[452]] contains constants of sort Voters
Arc [3:1*[453]] contains constants of sort Voters
Arc [3:1*[454]] contains constants of sort Voters
Arc [3:1*[455]] contains constants of sort Voters
Arc [3:1*[456]] contains constants of sort Voters
Arc [3:1*[457]] contains constants of sort Voters
Arc [3:1*[458]] contains constants of sort Voters
Arc [3:1*[459]] contains constants of sort Voters
Arc [3:1*[460]] contains constants of sort Voters
Arc [3:1*[461]] contains constants of sort Voters
Arc [3:1*[462]] contains constants of sort Voters
Arc [3:1*[463]] contains constants of sort Voters
Arc [3:1*[464]] contains constants of sort Voters
Arc [3:1*[465]] contains constants of sort Voters
Arc [3:1*[466]] contains constants of sort Voters
Arc [3:1*[467]] contains constants of sort Voters
Arc [3:1*[468]] contains constants of sort Voters
Arc [3:1*[469]] contains constants of sort Voters
Arc [3:1*[470]] contains constants of sort Voters
Arc [3:1*[471]] contains constants of sort Voters
Arc [3:1*[472]] contains constants of sort Voters
Arc [3:1*[473]] contains constants of sort Voters
Arc [3:1*[474]] contains constants of sort Voters
Arc [3:1*[475]] contains constants of sort Voters
Arc [3:1*[476]] contains constants of sort Voters
Arc [3:1*[477]] contains constants of sort Voters
Arc [3:1*[478]] contains constants of sort Voters
Arc [3:1*[479]] contains constants of sort Voters
Arc [3:1*[480]] contains constants of sort Voters
Arc [3:1*[481]] contains constants of sort Voters
Arc [3:1*[482]] contains constants of sort Voters
Arc [3:1*[483]] contains constants of sort Voters
Arc [3:1*[484]] contains constants of sort Voters
Arc [3:1*[485]] contains constants of sort Voters
Arc [3:1*[486]] contains constants of sort Voters
Arc [3:1*[487]] contains constants of sort Voters
Arc [3:1*[488]] contains constants of sort Voters
Arc [3:1*[489]] contains constants of sort Voters
Arc [3:1*[490]] contains constants of sort Voters
Arc [3:1*[491]] contains constants of sort Voters
Arc [3:1*[492]] contains constants of sort Voters
Arc [3:1*[493]] contains constants of sort Voters
Arc [3:1*[494]] contains constants of sort Voters
Arc [3:1*[495]] contains constants of sort Voters
Arc [3:1*[496]] contains constants of sort Voters
Arc [3:1*[497]] contains constants of sort Voters
Arc [3:1*[498]] contains constants of sort Voters
Arc [3:1*[499]] 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]], [3:1*[50]], [3:1*[51]], [3:1*[52]], [3:1*[53]], [3:1*[54]], [3:1*[55]], [3:1*[56]], [3:1*[57]], [3:1*[58]], [3:1*[59]], [3:1*[60]], [3:1*[61]], [3:1*[62]], [3:1*[63]], [3:1*[64]], [3:1*[65]], [3:1*[66]], [3:1*[67]], [3:1*[68]], [3:1*[69]], [3:1*[70]], [3:1*[71]], [3:1*[72]], [3:1*[73]], [3:1*[74]], [3:1*[75]], [3:1*[76]], [3:1*[77]], [3:1*[78]], [3:1*[79]], [3:1*[80]], [3:1*[81]], [3:1*[82]], [3:1*[83]], [3:1*[84]], [3:1*[85]], [3:1*[86]], [3:1*[87]], [3:1*[88]], [3:1*[89]], [3:1*[90]], [3:1*[91]], [3:1*[92]], [3:1*[93]], [3:1*[94]], [3:1*[95]], [3:1*[96]], [3:1*[97]], [3:1*[98]], [3:1*[99]], [3:1*[100]], [3:1*[101]], [3:1*[102]], [3:1*[103]], [3:1*[104]], [3:1*[105]], [3:1*[106]], [3:1*[107]], [3:1*[108]], [3:1*[109]], [3:1*[110]], [3:1*[111]], [3:1*[112]], [3:1*[113]], [3:1*[114]], [3:1*[115]], [3:1*[116]], [3:1*[117]], [3:1*[118]], [3:1*[119]], [3:1*[120]], [3:1*[121]], [3:1*[122]], [3:1*[123]], [3:1*[124]], [3:1*[125]], [3:1*[126]], [3:1*[127]], [3:1*[128]], [3:1*[129]], [3:1*[130]], [3:1*[131]], [3:1*[132]], [3:1*[133]], [3:1*[134]], [3:1*[135]], [3:1*[136]], [3:1*[137]], [3:1*[138]], [3:1*[139]], [3:1*[140]], [3:1*[141]], [3:1*[142]], [3:1*[143]], [3:1*[144]], [3:1*[145]], [3:1*[146]], [3:1*[147]], [3:1*[148]], [3:1*[149]], [3:1*[150]], [3:1*[151]], [3:1*[152]], [3:1*[153]], [3:1*[154]], [3:1*[155]], [3:1*[156]], [3:1*[157]], [3:1*[158]], [3:1*[159]], [3:1*[160]], [3:1*[161]], [3:1*[162]], [3:1*[163]], [3:1*[164]], [3:1*[165]], [3:1*[166]], [3:1*[167]], [3:1*[168]], [3:1*[169]], [3:1*[170]], [3:1*[171]], [3:1*[172]], [3:1*[173]], [3:1*[174]], [3:1*[175]], [3:1*[176]], [3:1*[177]], [3:1*[178]], [3:1*[179]], [3:1*[180]], [3:1*[181]], [3:1*[182]], [3:1*[183]], [3:1*[184]], [3:1*[185]], [3:1*[186]], [3:1*[187]], [3:1*[188]], [3:1*[189]], [3:1*[190]], [3:1*[191]], [3:1*[192]], [3:1*[193]], [3:1*[194]], [3:1*[195]], [3:1*[196]], [3:1*[197]], [3:1*[198]], [3:1*[199]], [3:1*[200]], [3:1*[201]], [3:1*[202]], [3:1*[203]], [3:1*[204]], [3:1*[205]], [3:1*[206]], [3:1*[207]], [3:1*[208]], [3:1*[209]], [3:1*[210]], [3:1*[211]], [3:1*[212]], [3:1*[213]], [3:1*[214]], [3:1*[215]], [3:1*[216]], [3:1*[217]], [3:1*[218]], [3:1*[219]], [3:1*[220]], [3:1*[221]], [3:1*[222]], [3:1*[223]], [3:1*[224]], [3:1*[225]], [3:1*[226]], [3:1*[227]], [3:1*[228]], [3:1*[229]], [3:1*[230]], [3:1*[231]], [3:1*[232]], [3:1*[233]], [3:1*[234]], [3:1*[235]], [3:1*[236]], [3:1*[237]], [3:1*[238]], [3:1*[239]], [3:1*[240]], [3:1*[241]], [3:1*[242]], [3:1*[243]], [3:1*[244]], [3:1*[245]], [3:1*[246]], [3:1*[247]], [3:1*[248]], [3:1*[249]], [3:1*[250]], [3:1*[251]], [3:1*[252]], [3:1*[253]], [3:1*[254]], [3:1*[255]], [3:1*[256]], [3:1*[257]], [3:1*[258]], [3:1*[259]], [3:1*[260]], [3:1*[261]], [3:1*[262]], [3:1*[263]], [3:1*[264]], [3:1*[265]], [3:1*[266]], [3:1*[267]], [3:1*[268]], [3:1*[269]], [3:1*[270]], [3:1*[271]], [3:1*[272]], [3:1*[273]], [3:1*[274]], [3:1*[275]], [3:1*[276]], [3:1*[277]], [3:1*[278]], [3:1*[279]], [3:1*[280]], [3:1*[281]], [3:1*[282]], [3:1*[283]], [3:1*[284]], [3:1*[285]], [3:1*[286]], [3:1*[287]], [3:1*[288]], [3:1*[289]], [3:1*[290]], [3:1*[291]], [3:1*[292]], [3:1*[293]], [3:1*[294]], [3:1*[295]], [3:1*[296]], [3:1*[297]], [3:1*[298]], [3:1*[299]], [3:1*[300]], [3:1*[301]], [3:1*[302]], [3:1*[303]], [3:1*[304]], [3:1*[305]], [3:1*[306]], [3:1*[307]], [3:1*[308]], [3:1*[309]], [3:1*[310]], [3:1*[311]], [3:1*[312]], [3:1*[313]], [3:1*[314]], [3:1*[315]], [3:1*[316]], [3:1*[317]], [3:1*[318]], [3:1*[319]], [3:1*[320]], [3:1*[321]], [3:1*[322]], [3:1*[323]], [3:1*[324]], [3:1*[325]], [3:1*[326]], [3:1*[327]], [3:1*[328]], [3:1*[329]], [3:1*[330]], [3:1*[331]], [3:1*[332]], [3:1*[333]], [3:1*[334]], [3:1*[335]], [3:1*[336]], [3:1*[337]], [3:1*[338]], [3:1*[339]], [3:1*[340]], [3:1*[341]], [3:1*[342]], [3:1*[343]], [3:1*[344]], [3:1*[345]], [3:1*[346]], [3:1*[347]], [3:1*[348]], [3:1*[349]], [3:1*[350]], [3:1*[351]], [3:1*[352]], [3:1*[353]], [3:1*[354]], [3:1*[355]], [3:1*[356]], [3:1*[357]], [3:1*[358]], [3:1*[359]], [3:1*[360]], [3:1*[361]], [3:1*[362]], [3:1*[363]], [3:1*[364]], [3:1*[365]], [3:1*[366]], [3:1*[367]], [3:1*[368]], [3:1*[369]], [3:1*[370]], [3:1*[371]], [3:1*[372]], [3:1*[373]], [3:1*[374]], [3:1*[375]], [3:1*[376]], [3:1*[377]], [3:1*[378]], [3:1*[379]], [3:1*[380]], [3:1*[381]], [3:1*[382]], [3:1*[383]], [3:1*[384]], [3:1*[385]], [3:1*[386]], [3:1*[387]], [3:1*[388]], [3:1*[389]], [3:1*[390]], [3:1*[391]], [3:1*[392]], [3:1*[393]], [3:1*[394]], [3:1*[395]], [3:1*[396]], [3:1*[397]], [3:1*[398]], [3:1*[399]], [3:1*[400]], [3:1*[401]], [3:1*[402]], [3:1*[403]], [3:1*[404]], [3:1*[405]], [3:1*[406]], [3:1*[407]], [3:1*[408]], [3:1*[409]], [3:1*[410]], [3:1*[411]], [3:1*[412]], [3:1*[413]], [3:1*[414]], [3:1*[415]], [3:1*[416]], [3:1*[417]], [3:1*[418]], [3:1*[419]], [3:1*[420]], [3:1*[421]], [3:1*[422]], [3:1*[423]], [3:1*[424]], [3:1*[425]], [3:1*[426]], [3:1*[427]], [3:1*[428]], [3:1*[429]], [3:1*[430]], [3:1*[431]], [3:1*[432]], [3:1*[433]], [3:1*[434]], [3:1*[435]], [3:1*[436]], [3:1*[437]], [3:1*[438]], [3:1*[439]], [3:1*[440]], [3:1*[441]], [3:1*[442]], [3:1*[443]], [3:1*[444]], [3:1*[445]], [3:1*[446]], [3:1*[447]], [3:1*[448]], [3:1*[449]], [3:1*[450]], [3:1*[451]], [3:1*[452]], [3:1*[453]], [3:1*[454]], [3:1*[455]], [3:1*[456]], [3:1*[457]], [3:1*[458]], [3:1*[459]], [3:1*[460]], [3:1*[461]], [3:1*[462]], [3:1*[463]], [3:1*[464]], [3:1*[465]], [3:1*[466]], [3:1*[467]], [3:1*[468]], [3:1*[469]], [3:1*[470]], [3:1*[471]], [3:1*[472]], [3:1*[473]], [3:1*[474]], [3:1*[475]], [3:1*[476]], [3:1*[477]], [3:1*[478]], [3:1*[479]], [3:1*[480]], [3:1*[481]], [3:1*[482]], [3:1*[483]], [3:1*[484]], [3:1*[485]], [3:1*[486]], [3:1*[487]], [3:1*[488]], [3:1*[489]], [3:1*[490]], [3:1*[491]], [3:1*[492]], [3:1*[493]], [3:1*[494]], [3:1*[495]], [3:1*[496]], [3:1*[497]], [3:1*[498]], [3:1*[499]]] introduces in Voters(500) 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 500
[2024-06-01 17:08:50] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 38 ms.
[2024-06-01 17:08:50] [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.
[2024-06-01 17:08:50] [INFO ] Invariant cache hit.
[2024-06-01 17:08:50] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 17:08:50] [INFO ] Invariant cache hit.
[2024-06-01 17:08:50] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:08:50] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:08:50] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 40236 steps (76 resets) in 91 ms. (437 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40000 steps (24 resets) in 225 ms. (176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (24 resets) in 316 ms. (126 steps per ms) remains 2/2 properties
[2024-06-01 17:08:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 1 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 4/7 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
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 : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 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
Applied a total of 1 rules in 6 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-06-01 17:08:51] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:51] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 17:08:51] [INFO ] Invariant cache hit.
[2024-06-01 17:08:51] [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.
[2024-06-01 17:08:51] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 72 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 95 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 : [(NOT p0), (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0500-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-00 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 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 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 6 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 17:08:51] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 17:08:51] [INFO ] Invariant cache hit.
[2024-06-01 17:08:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-06-01 17:08:51] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 17:08:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-04
Product exploration explored 100000 steps with 364 reset in 140 ms.
Product exploration explored 100000 steps with 413 reset in 88 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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 32 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0500-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-04 finished in 483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 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 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
[2024-06-01 17:08:52] [INFO ] Invariant cache hit.
[2024-06-01 17:08:52] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 17:08:52] [INFO ] Invariant cache hit.
[2024-06-01 17:08:52] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 17:08:52] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 17:08:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-05
Product exploration explored 100000 steps with 199 reset in 43 ms.
Product exploration explored 100000 steps with 199 reset in 99 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 p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 25 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0500-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-05 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 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
[2024-06-01 17:08:52] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 17:08:52] [INFO ] Invariant cache hit.
[2024-06-01 17:08:52] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 17:08:52] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-06
Product exploration explored 100000 steps with 1148 reset in 48 ms.
Product exploration explored 100000 steps with 1209 reset in 47 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 : [(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 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3529 steps (7 resets) in 5 ms. (588 steps per ms) remains 0/1 properties
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 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2024-06-01 17:08:53] [INFO ] Invariant cache hit.
[2024-06-01 17:08:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 17:08:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 17:08:53] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
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 196 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0500-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-06 finished in 1186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||G(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
[2024-06-01 17:08:53] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 17:08:53] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 17:08:53] [INFO ] Invariant cache hit.
[2024-06-01 17:08:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 17:08:53] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-07
Stuttering criterion allowed to conclude after 1003 steps with 1 reset in 7 ms.
FORMULA Referendum-COL-0500-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-07 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(G((p1||X(p2)))))))))'
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 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0500-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-09 finished in 374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
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.0 ms
Discarding 1 places :
Also discarding 0 output transitions
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
[2024-06-01 17:08:54] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 17:08:54] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p1)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0500-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-10 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(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 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2024-06-01 17:08:54] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
[2024-06-01 17:08:54] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/7 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-12
Product exploration explored 100000 steps with 16708 reset in 48 ms.
Product exploration explored 100000 steps with 16760 reset in 57 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 p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 298 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3014 steps (2 resets) in 4 ms. (602 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 11 factoid took 233 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 17:08:55] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 11 factoid took 266 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0500-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0500-LTLCardinality-12 finished in 1595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 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
[2024-06-01 17:08:56] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 17:08:56] [INFO ] Invariant cache hit.
[2024-06-01 17:08:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 3 constraints, problems are : Problem set: 0 solved, 2 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 5 constraints, problems are : Problem set: 0 solved, 2 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0500-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-14 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(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 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
[2024-06-01 17:08:56] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:56] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 17:08:56] [INFO ] Invariant cache hit.
[2024-06-01 17:08:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 1 sub problems to find dead transitions.
[2024-06-01 17:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/4 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 2 constraints, problems are : Problem set: 0 solved, 1 unsolved in 29 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/3 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/4 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 27 ms.
Refiners :[State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0500-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0500-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0500-LTLCardinality-15 finished in 293 ms.
All properties solved by simple procedures.
Total runtime 8406 ms.
ITS solved all properties within timeout

BK_STOP 1717261737095

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Referendum-COL-0500, 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 r520-tall-171662338800563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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