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-171662338800555.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-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662338800555
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.4K Apr 11 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 11 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 11 16:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 11 16:25 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 4.0K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 11 17:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 17:02 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 11K 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-0200-LTLCardinality-00
FORMULA_NAME Referendum-COL-0200-LTLCardinality-01
FORMULA_NAME Referendum-COL-0200-LTLCardinality-02
FORMULA_NAME Referendum-COL-0200-LTLCardinality-03
FORMULA_NAME Referendum-COL-0200-LTLCardinality-04
FORMULA_NAME Referendum-COL-0200-LTLCardinality-05
FORMULA_NAME Referendum-COL-0200-LTLCardinality-06
FORMULA_NAME Referendum-COL-0200-LTLCardinality-07
FORMULA_NAME Referendum-COL-0200-LTLCardinality-08
FORMULA_NAME Referendum-COL-0200-LTLCardinality-09
FORMULA_NAME Referendum-COL-0200-LTLCardinality-10
FORMULA_NAME Referendum-COL-0200-LTLCardinality-11
FORMULA_NAME Referendum-COL-0200-LTLCardinality-12
FORMULA_NAME Referendum-COL-0200-LTLCardinality-13
FORMULA_NAME Referendum-COL-0200-LTLCardinality-14
FORMULA_NAME Referendum-COL-0200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717261692211

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-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 17:08:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 17:08:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 17:08:13] [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:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 17:08:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 514 ms
[2024-06-01 17:08:14] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 601 PT places and 401.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 17:08:14] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2024-06-01 17:08:14] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 6 formulas.
FORMULA Referendum-COL-0200-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0200-LTLCardinality-15 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 10 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 40596 steps (196 resets) in 158 ms. (255 steps per ms) remains 4/21 properties
BEST_FIRST walk for 40004 steps (64 resets) in 300 ms. (132 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 269 ms. (148 steps per ms) remains 2/2 properties
// Phase 1: matrix 3 rows 4 cols
[2024-06-01 17:08:14] [INFO ] Computed 1 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 4/7 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms 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.
FORMULA Referendum-COL-0200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:08:14] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2024-06-01 17:08:14] [INFO ] Flatten gal took : 14 ms
FORMULA Referendum-COL-0200-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 17:08:14] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Arc [0:1*[100]] contains constants of sort Voters
Arc [0:1*[101]] contains constants of sort Voters
Arc [0:1*[102]] contains constants of sort Voters
Arc [0:1*[103]] contains constants of sort Voters
Arc [0:1*[104]] contains constants of sort Voters
Arc [0:1*[105]] contains constants of sort Voters
Arc [0:1*[106]] contains constants of sort Voters
Arc [0:1*[107]] contains constants of sort Voters
Arc [0:1*[108]] contains constants of sort Voters
Arc [0:1*[109]] contains constants of sort Voters
Arc [0:1*[110]] contains constants of sort Voters
Arc [0:1*[111]] contains constants of sort Voters
Arc [0:1*[112]] contains constants of sort Voters
Arc [0:1*[113]] contains constants of sort Voters
Arc [0:1*[114]] contains constants of sort Voters
Arc [0:1*[115]] contains constants of sort Voters
Arc [0:1*[116]] contains constants of sort Voters
Arc [0:1*[117]] contains constants of sort Voters
Arc [0:1*[118]] contains constants of sort Voters
Arc [0:1*[119]] contains constants of sort Voters
Arc [0:1*[120]] contains constants of sort Voters
Arc [0:1*[121]] contains constants of sort Voters
Arc [0:1*[122]] contains constants of sort Voters
Arc [0:1*[123]] contains constants of sort Voters
Arc [0:1*[124]] contains constants of sort Voters
Arc [0:1*[125]] contains constants of sort Voters
Arc [0:1*[126]] contains constants of sort Voters
Arc [0:1*[127]] contains constants of sort Voters
Arc [0:1*[128]] contains constants of sort Voters
Arc [0:1*[129]] contains constants of sort Voters
Arc [0:1*[130]] contains constants of sort Voters
Arc [0:1*[131]] contains constants of sort Voters
Arc [0:1*[132]] contains constants of sort Voters
Arc [0:1*[133]] contains constants of sort Voters
Arc [0:1*[134]] contains constants of sort Voters
Arc [0:1*[135]] contains constants of sort Voters
Arc [0:1*[136]] contains constants of sort Voters
Arc [0:1*[137]] contains constants of sort Voters
Arc [0:1*[138]] contains constants of sort Voters
Arc [0:1*[139]] contains constants of sort Voters
Arc [0:1*[140]] contains constants of sort Voters
Arc [0:1*[141]] contains constants of sort Voters
Arc [0:1*[142]] contains constants of sort Voters
Arc [0:1*[143]] contains constants of sort Voters
Arc [0:1*[144]] contains constants of sort Voters
Arc [0:1*[145]] contains constants of sort Voters
Arc [0:1*[146]] contains constants of sort Voters
Arc [0:1*[147]] contains constants of sort Voters
Arc [0:1*[148]] contains constants of sort Voters
Arc [0:1*[149]] contains constants of sort Voters
Arc [0:1*[150]] contains constants of sort Voters
Arc [0:1*[151]] contains constants of sort Voters
Arc [0:1*[152]] contains constants of sort Voters
Arc [0:1*[153]] contains constants of sort Voters
Arc [0:1*[154]] contains constants of sort Voters
Arc [0:1*[155]] contains constants of sort Voters
Arc [0:1*[156]] contains constants of sort Voters
Arc [0:1*[157]] contains constants of sort Voters
Arc [0:1*[158]] contains constants of sort Voters
Arc [0:1*[159]] contains constants of sort Voters
Arc [0:1*[160]] contains constants of sort Voters
Arc [0:1*[161]] contains constants of sort Voters
Arc [0:1*[162]] contains constants of sort Voters
Arc [0:1*[163]] contains constants of sort Voters
Arc [0:1*[164]] contains constants of sort Voters
Arc [0:1*[165]] contains constants of sort Voters
Arc [0:1*[166]] contains constants of sort Voters
Arc [0:1*[167]] contains constants of sort Voters
Arc [0:1*[168]] contains constants of sort Voters
Arc [0:1*[169]] contains constants of sort Voters
Arc [0:1*[170]] contains constants of sort Voters
Arc [0:1*[171]] contains constants of sort Voters
Arc [0:1*[172]] contains constants of sort Voters
Arc [0:1*[173]] contains constants of sort Voters
Arc [0:1*[174]] contains constants of sort Voters
Arc [0:1*[175]] contains constants of sort Voters
Arc [0:1*[176]] contains constants of sort Voters
Arc [0:1*[177]] contains constants of sort Voters
Arc [0:1*[178]] contains constants of sort Voters
Arc [0:1*[179]] contains constants of sort Voters
Arc [0:1*[180]] contains constants of sort Voters
Arc [0:1*[181]] contains constants of sort Voters
Arc [0:1*[182]] contains constants of sort Voters
Arc [0:1*[183]] contains constants of sort Voters
Arc [0:1*[184]] contains constants of sort Voters
Arc [0:1*[185]] contains constants of sort Voters
Arc [0:1*[186]] contains constants of sort Voters
Arc [0:1*[187]] contains constants of sort Voters
Arc [0:1*[188]] contains constants of sort Voters
Arc [0:1*[189]] contains constants of sort Voters
Arc [0:1*[190]] contains constants of sort Voters
Arc [0:1*[191]] contains constants of sort Voters
Arc [0:1*[192]] contains constants of sort Voters
Arc [0:1*[193]] contains constants of sort Voters
Arc [0:1*[194]] contains constants of sort Voters
Arc [0:1*[195]] contains constants of sort Voters
Arc [0:1*[196]] contains constants of sort Voters
Arc [0:1*[197]] contains constants of sort Voters
Arc [0:1*[198]] contains constants of sort Voters
Arc [0:1*[199]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]], [0:1*[100]], [0:1*[101]], [0:1*[102]], [0:1*[103]], [0:1*[104]], [0:1*[105]], [0:1*[106]], [0:1*[107]], [0:1*[108]], [0:1*[109]], [0:1*[110]], [0:1*[111]], [0:1*[112]], [0:1*[113]], [0:1*[114]], [0:1*[115]], [0:1*[116]], [0:1*[117]], [0:1*[118]], [0:1*[119]], [0:1*[120]], [0:1*[121]], [0:1*[122]], [0:1*[123]], [0:1*[124]], [0:1*[125]], [0:1*[126]], [0:1*[127]], [0:1*[128]], [0:1*[129]], [0:1*[130]], [0:1*[131]], [0:1*[132]], [0:1*[133]], [0:1*[134]], [0:1*[135]], [0:1*[136]], [0:1*[137]], [0:1*[138]], [0:1*[139]], [0:1*[140]], [0:1*[141]], [0:1*[142]], [0:1*[143]], [0:1*[144]], [0:1*[145]], [0:1*[146]], [0:1*[147]], [0:1*[148]], [0:1*[149]], [0:1*[150]], [0:1*[151]], [0:1*[152]], [0:1*[153]], [0:1*[154]], [0:1*[155]], [0:1*[156]], [0:1*[157]], [0:1*[158]], [0:1*[159]], [0:1*[160]], [0:1*[161]], [0:1*[162]], [0:1*[163]], [0:1*[164]], [0:1*[165]], [0:1*[166]], [0:1*[167]], [0:1*[168]], [0:1*[169]], [0:1*[170]], [0:1*[171]], [0:1*[172]], [0:1*[173]], [0:1*[174]], [0:1*[175]], [0:1*[176]], [0:1*[177]], [0:1*[178]], [0:1*[179]], [0:1*[180]], [0:1*[181]], [0:1*[182]], [0:1*[183]], [0:1*[184]], [0:1*[185]], [0:1*[186]], [0:1*[187]], [0:1*[188]], [0:1*[189]], [0:1*[190]], [0:1*[191]], [0:1*[192]], [0:1*[193]], [0:1*[194]], [0:1*[195]], [0:1*[196]], [0:1*[197]], [0:1*[198]], [0:1*[199]]] introduces in Voters(200) 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 200
[2024-06-01 17:08:14] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 27 ms.
[2024-06-01 17:08:14] [INFO ] Unfolded 8 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 6 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:14] [INFO ] Invariant cache hit.
[2024-06-01 17:08:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 17:08:14] [INFO ] Invariant cache hit.
[2024-06-01 17:08:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:14] [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) 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 38 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 47 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 88ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 90ms
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2024-06-01 17:08:15] [INFO ] Flatten gal took : 1 ms
[2024-06-01 17:08:15] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:08:15] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 40596 steps (196 resets) in 24 ms. (1623 steps per ms) remains 2/17 properties
BEST_FIRST walk for 2187 steps (1 resets) in 10 ms. (198 steps per ms) remains 0/2 properties
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' '!(X((G(p0)||((p1 U p2)&&(p2 U (p3&&F(!p0)))))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:15] [INFO ] Invariant cache hit.
[2024-06-01 17:08:15] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 17:08:15] [INFO ] Invariant cache hit.
[2024-06-01 17:08:15] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:15] [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) 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 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]
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 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]
After SMT, in 72ms 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 121 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 518 ms :[true, (NOT p2), (OR (NOT p3) p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), p0]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 8 steps with 2 reset in 2 ms.
FORMULA Referendum-COL-0200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-00 finished in 710 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(((p1 U (p2 U X(X(p3))))&&p0)))'
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.
[2024-06-01 17:08:16] [INFO ] Invariant cache hit.
[2024-06-01 17:08:16] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 17:08:16] [INFO ] Invariant cache hit.
[2024-06-01 17:08:16] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:16] [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) 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 35 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 40 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 78ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-02
Product exploration explored 100000 steps with 8409 reset in 265 ms.
Product exploration explored 100000 steps with 8416 reset in 116 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) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 1466 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Reduction of identical properties reduced properties to check from 20 to 19
RANDOM walk for 40596 steps (196 resets) in 68 ms. (588 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40004 steps (64 resets) in 184 ms. (216 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40004 steps (64 resets) in 133 ms. (298 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 166 ms. (239 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (64 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
[2024-06-01 17:08:19] [INFO ] Invariant cache hit.
Problem apf5 is UNSAT
Problem apf12 is UNSAT
Problem apf16 is UNSAT
After SMT solving in domain Real declared 3/7 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 27ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p1) (NOT p0) p3)), (G (OR p1 (NOT p2) (NOT p0) p3)), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (NOT (AND (OR p1 (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (AND (OR p1 (NOT p2) p3) (OR (NOT p2) p0 p3)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F p3), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p3))))]
Knowledge based reduction with 38 factoid took 6705 ms. Reduced automaton from 8 states, 28 edges and 4 AP (stutter sensitive) to 8 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
[2024-06-01 17:08:26] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2024-06-01 17:08:26] [INFO ] Invariant cache hit.
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 (NOT p3)), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X p1), (X (X (NOT p0))), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND p0 p1 (NOT p3))))), (X (X (AND p1 (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3)))))), (X (X (OR (AND (NOT p0) p2 (NOT p3)) (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (OR (NOT p1) (NOT p0) p3)), (G (OR p1 (NOT p2) (NOT p0) p3)), (G (OR p1 p2 (NOT p0) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (F (NOT (AND (OR p1 (NOT p2)) (OR (NOT p2) p0)))), (F (NOT (AND (OR p1 (NOT p2) p3) (OR (NOT p2) p0 p3)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F p3), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR p1 p2 p3))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))))), (F p0), (F (NOT (OR p1 (NOT p2) p3))), (F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 (NOT p3)))), (G (NOT p0)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 38 factoid took 6880 ms. Reduced automaton from 8 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0200-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLCardinality-02 finished in 17525 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((p0||(p1 U p2))))'
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:33] [INFO ] Invariant cache hit.
[2024-06-01 17:08:33] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 17:08:33] [INFO ] Invariant cache hit.
[2024-06-01 17:08:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:33] [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) 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 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]
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 65ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 76 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 p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 13 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0200-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLCardinality-03 finished in 455 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((F(p0) U (p1&&F(p2))))))'
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 3 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:34] [INFO ] Invariant cache hit.
[2024-06-01 17:08:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 17:08:34] [INFO ] Invariant cache hit.
[2024-06-01 17:08:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 17:08:34] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:34] [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) 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 49 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 34 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 87ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-04
Product exploration explored 100000 steps with 732 reset in 66 ms.
Product exploration explored 100000 steps with 731 reset in 103 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 174 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0200-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0200-LTLCardinality-04 finished in 717 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))&&F(p1)) U X(X(G(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.
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 3 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:34] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:34] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 17:08:34] [INFO ] Invariant cache hit.
[2024-06-01 17:08:34] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:34] [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 31 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 27 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-05
Product exploration explored 100000 steps with 29512 reset in 123 ms.
Product exploration explored 100000 steps with 29590 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 : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 351 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
RANDOM walk for 40596 steps (196 resets) in 47 ms. (845 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
[2024-06-01 17:08:36] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 1/6 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 11 ms.
Refiners :[State Equation: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 13ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 12 factoid took 1066 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:37] [INFO ] Invariant cache hit.
[2024-06-01 17:08:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 17:08:37] [INFO ] Invariant cache hit.
[2024-06-01 17:08:37] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:37] [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 34 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 69ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 262 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 1417 steps (3 resets) in 4 ms. (283 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 9 factoid took 611 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 29585 reset in 51 ms.
Product exploration explored 100000 steps with 29599 reset in 56 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:40] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:40] [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 28 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 31 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 ms. Remains : 3/3 places, 3/3 transitions.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:40] [INFO ] Invariant cache hit.
[2024-06-01 17:08:40] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-06-01 17:08:40] [INFO ] Invariant cache hit.
[2024-06-01 17:08:40] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:40] [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 26 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 21 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 50ms
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0200-LTLCardinality-05 finished in 6178 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((G(p0)||X(p1)))&&F(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 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:41] [INFO ] Invariant cache hit.
[2024-06-01 17:08:41] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 17:08:41] [INFO ] Invariant cache hit.
[2024-06-01 17:08:41] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:41] [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 23 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 23 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 51ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0, (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) p1)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 5568 steps with 50 reset in 12 ms.
FORMULA Referendum-COL-0200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-06 finished in 339 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(p0)||G((p1||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.
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:41] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:41] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 17:08:41] [INFO ] Invariant cache hit.
[2024-06-01 17:08:41] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:41] [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 30 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 26 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, false, (AND p1 (NOT p0)), p1, false, false, false, false]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-08
Product exploration explored 100000 steps with 495 reset in 80 ms.
Product exploration explored 100000 steps with 495 reset in 87 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[true, false, p1, false, false, false, false]
RANDOM walk for 3650 steps (14 resets) in 4 ms. (730 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[true, false, p1, false, false, false, false]
Stuttering acceptance computed with spot in 215 ms :[true, false, p1, false, false, false, false]
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:42] [INFO ] Invariant cache hit.
[2024-06-01 17:08:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 17:08:42] [INFO ] Invariant cache hit.
[2024-06-01 17:08:42] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:42] [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 23 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 29 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, false, p1, false, false, false, false]
RANDOM walk for 1214 steps (2 resets) in 5 ms. (202 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, false, p1, false, false, false, false]
Stuttering acceptance computed with spot in 234 ms :[true, false, p1, false, false, false, false]
Stuttering acceptance computed with spot in 206 ms :[true, false, p1, false, false, false, false]
Product exploration explored 100000 steps with 495 reset in 49 ms.
Product exploration explored 100000 steps with 495 reset in 53 ms.
Applying partial POR strategy [true, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 215 ms :[true, false, p1, false, false, false, false]
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:44] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:44] [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 22 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 26 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 50ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56 ms. Remains : 3/3 places, 3/3 transitions.
Support contains 3 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:44] [INFO ] Invariant cache hit.
[2024-06-01 17:08:44] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 17:08:44] [INFO ] Invariant cache hit.
[2024-06-01 17:08:44] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:44] [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 31 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 27 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0200-LTLCardinality-08 finished in 3490 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(p0)||F(G(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.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:44] [INFO ] Invariant cache hit.
[2024-06-01 17:08:44] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 17:08:44] [INFO ] Invariant cache hit.
[2024-06-01 17:08:44] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 17:08:44] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:44] [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 21 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 33 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 56ms
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 106 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-13
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0200-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0200-LTLCardinality-13 finished in 193 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))&&F(p1)) U X(X(G(p2)))))'
Found a Lengthening insensitive property : Referendum-COL-0200-LTLCardinality-05
Stuttering acceptance computed with spot in 345 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LI_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:45] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 17:08:45] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 17:08:45] [INFO ] Invariant cache hit.
[2024-06-01 17:08:45] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:45] [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 21 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 26 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 48ms
Starting structural reductions in LI_LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 80 ms. Remains : 3/4 places, 3/3 transitions.
Running random walk in product with property : Referendum-COL-0200-LTLCardinality-05
Product exploration explored 100000 steps with 29602 reset in 39 ms.
Product exploration explored 100000 steps with 29603 reset in 43 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 352 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 451 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
RANDOM walk for 40596 steps (196 resets) in 10 ms. (3690 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (64 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-06-01 17:08:46] [INFO ] Invariant cache hit.
Problem apf4 is UNSAT
After SMT solving in domain Real declared 1/6 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 12 ms.
Refiners :[State Equation: 0/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 14ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (OR p2 p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (AND p2 (NOT p0))))]
Knowledge based reduction with 12 factoid took 1099 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:48] [INFO ] Invariant cache hit.
[2024-06-01 17:08:48] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 17:08:48] [INFO ] Invariant cache hit.
[2024-06-01 17:08:48] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
Running 2 sub problems to find dead transitions.
[2024-06-01 17:08:48] [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 25 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 26 ms.
Refiners :[State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 52ms
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 294 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
RANDOM walk for 1214 steps (2 resets) in 4 ms. (242 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p2)), (X (X p1)), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 9 factoid took 595 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 29620 reset in 39 ms.
Product exploration explored 100000 steps with 29517 reset in 51 ms.
Applying partial POR strategy [false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (NOT p1)]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[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 25 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 33 ms.
Refiners :[State Equation: 3/3 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 SI_LTL mode , in 1 iterations and 67 ms. Remains : 3/3 places, 3/3 transitions.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 17:08:51] [INFO ] Invariant cache hit.
[2024-06-01 17:08:51] [INFO ] Implicit Places using invariants in 12 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 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
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 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 27 ms.
Refiners :[State Equation: 3/3 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 91 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0200-LTLCardinality-05 finished in 6359 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(p0)||G((p1||G(!p1)))))))'
[2024-06-01 17:08:51] [INFO ] Flatten gal took : 2 ms
[2024-06-01 17:08:51] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 17:08:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 3 transitions and 6 arcs took 3 ms.
Total runtime 38120 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Referendum-COL-0200-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Referendum-COL-0200-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717261732391

--------------------
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
mcc2024
ltl formula name Referendum-COL-0200-LTLCardinality-05
ltl formula formula --ltl=/tmp/2120/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 4 places, 3 transitions and 6 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2120/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2120/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2120/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2120/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 3 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5, there are 20 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~203!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 510
pnml2lts-mc( 0/ 4): unique states count: 944
pnml2lts-mc( 0/ 4): unique transitions count: 2284
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 144
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 962
pnml2lts-mc( 0/ 4): - cum. max stack depth: 452
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 962 states 2349 transitions, fanout: 2.442
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96200, Transitions per second: 234900
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 13.0 B/state, compr.: 59.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name Referendum-COL-0200-LTLCardinality-08
ltl formula formula --ltl=/tmp/2120/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 4 places, 3 transitions and 6 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2120/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2120/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2120/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2120/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 4 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 5, there are 16 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~203 levels ~10000 states ~19532 transitions
pnml2lts-mc( 0/ 4): ~203 levels ~20000 states ~39312 transitions
pnml2lts-mc( 0/ 4): ~203 levels ~40000 states ~79036 transitions
pnml2lts-mc( 0/ 4): ~203 levels ~80000 states ~158584 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20503
pnml2lts-mc( 0/ 4): unique states count: 20503
pnml2lts-mc( 0/ 4): unique transitions count: 40603
pnml2lts-mc( 0/ 4): - self-loop count: 326
pnml2lts-mc( 0/ 4): - claim dead count: 59611
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 61627
pnml2lts-mc( 0/ 4): - cum. max stack depth: 812
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 61627 states 122545 transitions, fanout: 1.988
pnml2lts-mc( 0/ 4): Total exploration time 0.290 sec (0.290 sec minimum, 0.290 sec on average)
pnml2lts-mc( 0/ 4): States per second: 212507, Transitions per second: 422569
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 16.1 B/state, compr.: 73.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 3 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)

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-0200"
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-0200, 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-171662338800555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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