Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.7K Mar 5 18:23 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-0100-LTLCardinality-00
FORMULA_NAME Referendum-COL-0100-LTLCardinality-01
FORMULA_NAME Referendum-COL-0100-LTLCardinality-02
FORMULA_NAME Referendum-COL-0100-LTLCardinality-03
FORMULA_NAME Referendum-COL-0100-LTLCardinality-04
FORMULA_NAME Referendum-COL-0100-LTLCardinality-05
FORMULA_NAME Referendum-COL-0100-LTLCardinality-06
FORMULA_NAME Referendum-COL-0100-LTLCardinality-07
FORMULA_NAME Referendum-COL-0100-LTLCardinality-08
FORMULA_NAME Referendum-COL-0100-LTLCardinality-09
FORMULA_NAME Referendum-COL-0100-LTLCardinality-10
FORMULA_NAME Referendum-COL-0100-LTLCardinality-11
FORMULA_NAME Referendum-COL-0100-LTLCardinality-12
FORMULA_NAME Referendum-COL-0100-LTLCardinality-13
FORMULA_NAME Referendum-COL-0100-LTLCardinality-14
FORMULA_NAME Referendum-COL-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679131095428

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
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-0100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 09:18:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 09:18:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 09:18:17] [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.
[2023-03-18 09:18:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 09:18:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2023-03-18 09:18:17] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 301 PT places and 201.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 09:18:17] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 5 ms.
[2023-03-18 09:18:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Referendum-COL-0100-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-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 12 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Finished random walk after 308 steps, including 2 resets, run visited all 18 properties in 9 ms. (steps per millisecond=34 )
[2023-03-18 09:18:18] [INFO ] Flatten gal took : 11 ms
[2023-03-18 09:18:18] [INFO ] Flatten gal took : 2 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
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]]] introduces in Voters(100) 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 100
[2023-03-18 09:18:18] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 11 ms.
[2023-03-18 09:18:18] [INFO ] Unfolded 12 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 8 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-18 09:18:18] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-18 09:18:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-18 09:18:18] [INFO ] Invariant cache hit.
[2023-03-18 09:18:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-18 09:18:18] [INFO ] Invariant cache hit.
[2023-03-18 09:18:18] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-18 09:18:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 09:18:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 09:18:18] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 308 steps, including 2 resets, run visited all 18 properties in 14 ms. (steps per millisecond=22 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 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 4 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-18 09:18:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 09:18:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-18 09:18:18] [INFO ] Invariant cache hit.
[2023-03-18 09:18:18] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-18 09:18:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:18] [INFO ] Invariant cache hit.
[2023-03-18 09:18:18] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
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 74 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 980 reset in 180 ms.
Product exploration explored 100000 steps with 980 reset in 96 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=102 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-18 09:18:19] [INFO ] Invariant cache hit.
[2023-03-18 09:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:18:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-18 09:18:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:18:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-18 09:18:19] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-18 09:18:19] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
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.
[2023-03-18 09:18:19] [INFO ] Invariant cache hit.
[2023-03-18 09:18:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 09:18:19] [INFO ] Invariant cache hit.
[2023-03-18 09:18:19] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-18 09:18:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:19] [INFO ] Invariant cache hit.
[2023-03-18 09:18:19] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 617 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=205 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 09:18:20] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-18 09:18:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 09:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 09:18:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-18 09:18:20] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-18 09:18:20] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 980 reset in 148 ms.
Product exploration explored 100000 steps with 980 reset in 129 ms.
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.
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-18 09:18:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0100-LTLCardinality-01 finished in 2119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&G(p1)))))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-18 09:18:20] [INFO ] Invariant cache hit.
[2023-03-18 09:18:20] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s1), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-02 finished in 294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0||F(p1)) U (G((p0||F(p1)))||(p2&&(p0||F(p1))))))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-18 09:18:21] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GT 2 s1), p0:(GT s1 s2), p1:(GT s3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 101 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-03 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(X(p1) U (X(G(p1))||(p1&&X(p1))))))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(GT 1 s1), p1:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 120 steps with 2 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-04 finished in 192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
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.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (GT s3 s0) (GT s1 s3)), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-05 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-18 09:18:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:21] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s0 s2), p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 105 steps with 2 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-06 finished in 244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0&&X(p1)))&&G(p2))))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:18:21] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [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.
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (OR (NOT p2) (NOT p1) p0), (OR (NOT p2) (NOT p1) p0), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1) p0), (NOT p2)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=1, aps=[p2:(AND (LEQ s0 s2) (LEQ 1 s2)), p0:(GT s2 s0), p1:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-07 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, p0, p0]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 308 steps with 3 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-08 finished in 179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 3 /4 variables (removed 1) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 3 cols
[2023-03-18 09:18:22] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 09:18:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 3/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 100 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-09 finished in 117 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)&&(F(p1) U p2)))'
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
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
[2023-03-18 09:18:22] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-18 09:18:22] [INFO ] Invariant cache hit.
[2023-03-18 09:18:22] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 3/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p2) p0), p0, (NOT p1), (NOT p2), true]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 3 s0), p1:(GT 1 s2), p0:(GT s2 s1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Product exploration explored 100000 steps with 50000 reset in 99 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 p2) (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X p2), (X (NOT p0)), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p2)), (F (G (NOT p2))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 12 factoid took 278 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0100-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0100-LTLCardinality-11 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((!p0||G(p0)))&&(p1 U (!p0||X(!p0))))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-18 09:18:23] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 09:18:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-18 09:18:23] [INFO ] Invariant cache hit.
[2023-03-18 09:18:23] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-18 09:18:23] [INFO ] Invariant cache hit.
[2023-03-18 09:18:23] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 215 ms :[p0, false, p0, (NOT p0), true, p0]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(GT 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-13 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((X(p1)&&(!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 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-18 09:18:23] [INFO ] Invariant cache hit.
[2023-03-18 09:18:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-18 09:18:23] [INFO ] Invariant cache hit.
[2023-03-18 09:18:23] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-18 09:18:23] [INFO ] Invariant cache hit.
[2023-03-18 09:18:23] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (NOT p1), (NOT p2), (NOT p0), (AND p1 (NOT p2)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 7}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={0} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=7 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ s0 s1), p2:(LEQ 1 s2), p1:(LEQ s0 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Referendum-COL-0100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0100-LTLCardinality-14 finished in 446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-18 09:18:24] [INFO ] Flatten gal took : 3 ms
[2023-03-18 09:18:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-18 09:18:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 4 places, 3 transitions and 6 arcs took 0 ms.
Total runtime 7215 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/993/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Referendum-COL-0100-LTLCardinality-01

BK_STOP 1679131105882

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Referendum-COL-0100-LTLCardinality-01
ltl formula formula --ltl=/tmp/993/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
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( 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/993/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/993/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/993/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/993/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

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-0100"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Referendum-COL-0100, 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 r329-tall-167889202000435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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