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.r327-tall-167889199600419.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 lolaxred
Input is Referendum-COL-0020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r327-tall-167889199600419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 17:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:25 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 3.8K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 10K Feb 26 17:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 17:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 26 17:28 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 3.8K 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-0020-LTLCardinality-00
FORMULA_NAME Referendum-COL-0020-LTLCardinality-01
FORMULA_NAME Referendum-COL-0020-LTLCardinality-02
FORMULA_NAME Referendum-COL-0020-LTLCardinality-03
FORMULA_NAME Referendum-COL-0020-LTLCardinality-04
FORMULA_NAME Referendum-COL-0020-LTLCardinality-05
FORMULA_NAME Referendum-COL-0020-LTLCardinality-06
FORMULA_NAME Referendum-COL-0020-LTLCardinality-07
FORMULA_NAME Referendum-COL-0020-LTLCardinality-08
FORMULA_NAME Referendum-COL-0020-LTLCardinality-09
FORMULA_NAME Referendum-COL-0020-LTLCardinality-10
FORMULA_NAME Referendum-COL-0020-LTLCardinality-11
FORMULA_NAME Referendum-COL-0020-LTLCardinality-12
FORMULA_NAME Referendum-COL-0020-LTLCardinality-13
FORMULA_NAME Referendum-COL-0020-LTLCardinality-14
FORMULA_NAME Referendum-COL-0020-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679049004998

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0020
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-17 10:30:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 10:30:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:30:06] [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-17 10:30:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 10:30:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 613 ms
[2023-03-17 10:30:07] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 61 PT places and 41.0 transition bindings in 10 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 10:30:07] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 4 ms.
[2023-03-17 10:30:07] [INFO ] Skeletonized 16 HLPN properties in 3 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).
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10004 steps, including 434 resets, run finished after 82 ms. (steps per millisecond=122 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:30:07] [INFO ] Computed 1 place invariants in 4 ms
[2023-03-17 10:30:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:07] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-17 10:30:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:07] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-17 10:30:07] [INFO ] Flatten gal took : 13 ms
[2023-03-17 10:30:07] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [3:1*[0]] contains constants of sort Voters
Arc [3:1*[1]] contains constants of sort Voters
Arc [3:1*[2]] contains constants of sort Voters
Arc [3:1*[3]] contains constants of sort Voters
Arc [3:1*[4]] contains constants of sort Voters
Arc [3:1*[5]] contains constants of sort Voters
Arc [3:1*[6]] contains constants of sort Voters
Arc [3:1*[7]] contains constants of sort Voters
Arc [3:1*[8]] contains constants of sort Voters
Arc [3:1*[9]] contains constants of sort Voters
Arc [3:1*[10]] contains constants of sort Voters
Arc [3:1*[11]] contains constants of sort Voters
Arc [3:1*[12]] contains constants of sort Voters
Arc [3:1*[13]] contains constants of sort Voters
Arc [3:1*[14]] contains constants of sort Voters
Arc [3:1*[15]] contains constants of sort Voters
Arc [3:1*[16]] contains constants of sort Voters
Arc [3:1*[17]] contains constants of sort Voters
Arc [3:1*[18]] contains constants of sort Voters
Arc [3:1*[19]] contains constants of sort Voters
Transition start : constants on arcs in [[3:1*[0]], [3:1*[1]], [3:1*[2]], [3:1*[3]], [3:1*[4]], [3:1*[5]], [3:1*[6]], [3:1*[7]], [3:1*[8]], [3:1*[9]], [3:1*[10]], [3:1*[11]], [3:1*[12]], [3:1*[13]], [3:1*[14]], [3:1*[15]], [3:1*[16]], [3:1*[17]], [3:1*[18]], [3:1*[19]]] introduces in Voters(20) 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 20
[2023-03-17 10:30:07] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 5 ms.
[2023-03-17 10:30:07] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Support contains 4 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 4 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:30:07] [INFO ] Invariant cache hit.
[2023-03-17 10:30:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:30:07] [INFO ] Invariant cache hit.
[2023-03-17 10:30:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 10:30:07] [INFO ] Invariant cache hit.
[2023-03-17 10:30:07] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 4 out of 4 places after structural reductions.
[2023-03-17 10:30:08] [INFO ] Flatten gal took : 2 ms
[2023-03-17 10:30:08] [INFO ] Flatten gal took : 3 ms
[2023-03-17 10:30:08] [INFO ] Input system was already deterministic with 3 transitions.
Incomplete random walk after 10004 steps, including 434 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 10:30:08] [INFO ] Invariant cache hit.
[2023-03-17 10:30:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:08] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-17 10:30:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-17 10:30:08] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(p1)))||(p2&&X(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.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:30:08] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:30:08] [INFO ] Invariant cache hit.
[2023-03-17 10:30:08] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-17 10:30:08] [INFO ] Invariant cache hit.
[2023-03-17 10:30:08] [INFO ] Dead Transitions using invariants and state equation in 22 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 75 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 390 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), p2]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 0}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s0 s1), p0:(LEQ 1 s2), p2:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 268 ms.
Product exploration explored 100000 steps with 4545 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 p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X (AND p0 p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1655 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X (AND p0 p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 34 factoid took 1526 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2023-03-17 10:30:13] [INFO ] Invariant cache hit.
[2023-03-17 10:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-17 10:30:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:13] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:30:13] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-17 10:30:13] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
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.
[2023-03-17 10:30:13] [INFO ] Invariant cache hit.
[2023-03-17 10:30:13] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:30:13] [INFO ] Invariant cache hit.
[2023-03-17 10:30:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-17 10:30:13] [INFO ] Invariant cache hit.
[2023-03-17 10:30:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 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) (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 557 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 549 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2023-03-17 10:30:14] [INFO ] Invariant cache hit.
[2023-03-17 10:30:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-17 10:30:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:14] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-17 10:30:14] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 10:30:14] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4545 reset in 59 ms.
Product exploration explored 100000 steps with 4545 reset in 54 ms.
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.
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0020-LTLCardinality-00 finished in 6746 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))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:30:15] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:15] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-17 10:30:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0020-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-01 finished in 373 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(X(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 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:30:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-17 10:30:15] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:30:15] [INFO ] Invariant cache hit.
[2023-03-17 10:30:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 233 ms :[p1, p1, (OR (NOT p0) p1), (OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p1:(LEQ 1 s3), p0:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 112 steps with 5 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-02 finished in 308 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((p1||X(X(!p0))))))'
Support contains 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:30:16] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:30:16] [INFO ] Invariant cache hit.
[2023-03-17 10:30:16] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:30:16] [INFO ] Invariant cache hit.
[2023-03-17 10:30:16] [INFO ] Dead Transitions using invariants and state equation in 17 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 58 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 324 ms :[(AND p0 (NOT p1)), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, p0, true, (AND p0 (NOT p1)), false, (AND p0 (NOT p1)), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=p0, acceptance={} source=7 dest: 9}], [{ cond=p0, acceptance={0} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 5}, { cond=p0, acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 131 ms.
Product exploration explored 100000 steps with 25000 reset in 91 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 p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 377 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0, true]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 389 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0, true]
Support contains 1 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.
[2023-03-17 10:30:18] [INFO ] Invariant cache hit.
[2023-03-17 10:30:18] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-17 10:30:18] [INFO ] Invariant cache hit.
[2023-03-17 10:30:18] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2023-03-17 10:30:18] [INFO ] Invariant cache hit.
[2023-03-17 10:30:18] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 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), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[p0, p0, p0, p0, true]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 157 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 61 ms.
Product exploration explored 100000 steps with 25000 reset in 38 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, p0, true]
Support contains 1 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 6 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:30:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 3/3 places, 3/3 transitions.
Support contains 1 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.
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0020-LTLCardinality-03 finished in 3486 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(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 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-17 10:30:19] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Dead Transitions using invariants and state equation in 21 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 75 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-04 finished in 173 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((X((F(p0) U X(!X(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.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:30:19] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-17 10:30:19] [INFO ] Invariant cache hit.
[2023-03-17 10:30:19] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 377 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=true, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=p1, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(OR (LEQ s3 s1) (GT 2 s1)), p0:(LEQ 1 s2), p1:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-05 finished in 495 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 U p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:30:20] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:30:20] [INFO ] Invariant cache hit.
[2023-03-17 10:30:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-17 10:30:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:30:20] [INFO ] Invariant cache hit.
[2023-03-17 10:30:20] [INFO ] Dead Transitions using invariants and state equation in 24 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 82 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 2 s1), p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4545 reset in 159 ms.
Product exploration explored 100000 steps with 4545 reset in 147 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) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 6 factoid took 349 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
[2023-03-17 10:30:21] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 255 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0020-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-06 finished in 1772 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(G(p1))) U (F(G(!p2))||G((!p0&&F(G(p1))))||(G(p3)&&(F(G(!p2))||(!p0&&F(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.
// Phase 1: matrix 3 rows 4 cols
[2023-03-17 10:30:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-17 10:30:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-17 10:30:22] [INFO ] Invariant cache hit.
[2023-03-17 10:30:22] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-17 10:30:22] [INFO ] Invariant cache hit.
[2023-03-17 10:30:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 4/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p2 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p2 p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={1} source=3 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p3) p0), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p3 p0), acceptance={2} source=3 dest: 3}, { cond=(AND p2 p3 p0), acceptance={0, 2} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s2 s0), p3:(GT s3 s1), p0:(LEQ s0 s1), p1:(GT s2 s3)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 100 ms.
Product exploration explored 100000 steps with 4545 reset in 97 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 p3) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (AND p2 p0)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 22 factoid took 1747 ms. Reduced automaton from 4 states, 21 edges and 4 AP (stutter sensitive) to 4 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p1) p2) (AND p0 p2)), (OR (AND (NOT p1) p2) (AND p0 p2)), (AND p2 (NOT p1)), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 p2 (NOT p3)))]
Incomplete random walk after 10004 steps, including 434 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 10:30:24] [INFO ] Invariant cache hit.
[2023-03-17 10:30:24] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 10:30:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:24] [INFO ] After 23ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (AND p2 p0)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (AND p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p3 p0 p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (F (AND p3 p0 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F (AND (NOT p3) p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 26 factoid took 1583 ms. Reduced automaton from 4 states, 21 edges and 4 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[p2, p2, p2]
Stuttering acceptance computed with spot in 120 ms :[p2, p2, p2]
[2023-03-17 10:30:26] [INFO ] Invariant cache hit.
[2023-03-17 10:30:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-17 10:30:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-17 10:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned unsat
Proved EG p2
Knowledge obtained : [(AND p2 (NOT p3) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p0)))), (X (AND p2 p0)), (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1))))), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p3 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p3))), (F (G p0)), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p1 p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (AND p3 (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X (X (AND p2 p0))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p3 p0))), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p3 p0))), (X (X (NOT (AND p2 p3 p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p3 p0 p2)), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p1) (NOT p0))))), (F (AND p3 p0 (NOT p2))), (F (AND p0 p2)), (F (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (F (AND (NOT p3) p0 p2)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p3) (NOT p0) p2))), (F (AND (NOT p3) p0 (NOT p2))), (F (NOT (AND (NOT p1) p2))), (G p2)]
Property proved to be false thanks to negative knowledge :(G p2)
Knowledge based reduction with 26 factoid took 909 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0020-LTLCardinality-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-07 finished in 5691 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(p1)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 3 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:30:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:30:27] [INFO ] Invariant cache hit.
[2023-03-17 10:30:27] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-17 10:30:27] [INFO ] Invariant cache hit.
[2023-03-17 10:30:27] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LEQ 2 s1) (LEQ 1 s0)), p1:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-08 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((G(F((p0||G(p1))))||(p2&&X(F((G(p1)||X(F(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.
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-17 10:30:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:30:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:30:28] [INFO ] Invariant cache hit.
[2023-03-17 10:30:28] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 10:30:28] [INFO ] Invariant cache hit.
[2023-03-17 10:30:28] [INFO ] Dead Transitions using invariants and state equation in 17 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 61 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=0, aps=[p2:(GT 1 s1), p0:(GT s2 s1), p1:(GT s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40021 reset in 62 ms.
Product exploration explored 100000 steps with 39959 reset in 53 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) (NOT p1))
Knowledge based reduction with 16 factoid took 679 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-09 finished in 1082 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 p1))||X(X(F(!p0)))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 2 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [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 80 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 1}, { cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(GT s2 s1), p1:(LEQ 3 s2)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 6424 reset in 50 ms.
Product exploration explored 100000 steps with 6429 reset in 62 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 p0) (NOT p1)), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 8 factoid took 154 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0020-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-10 finished in 569 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' '!(((!p0&&X(p0)) U X(G(p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:30:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Dead Transitions using invariants and state equation in 20 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 55 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-11 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(OR p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 s1), p1:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-11 finished in 168 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 1 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 2 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 2
Applied a total of 2 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:30:29] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:30:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s1)], 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 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-12 finished in 131 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(p1))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Graph (complete) has 3 edges and 4 vertex of which 3 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-17 10:30:29] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2023-03-17 10:30:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-17 10:30:29] [INFO ] Invariant cache hit.
[2023-03-17 10:30:29] [INFO ] Dead Transitions using invariants and state equation in 19 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 63 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(GT s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-13 finished in 141 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(G(p0))))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 1 ms. Remains 3 /4 variables (removed 1) and now considering 3/3 (removed 0) transitions.
[2023-03-17 10:30:30] [INFO ] Invariant cache hit.
[2023-03-17 10:30:30] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-17 10:30:30] [INFO ] Invariant cache hit.
[2023-03-17 10:30:30] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-17 10:30:30] [INFO ] Invariant cache hit.
[2023-03-17 10:30:30] [INFO ] Dead Transitions using invariants and state equation in 18 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 63 ms. Remains : 3/4 places, 3/3 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Referendum-COL-0020-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Referendum-COL-0020-LTLCardinality-14 finished in 206 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)))'
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-17 10:30:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:30] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 10:30:30] [INFO ] Invariant cache hit.
[2023-03-17 10:30:30] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-17 10:30:30] [INFO ] Invariant cache hit.
[2023-03-17 10:30:30] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 2/4 places, 2/3 transitions.
Stuttering acceptance computed with spot in 78 ms :[p0, p0]
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s1 s0)], 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][false, false]]
Product exploration explored 100000 steps with 4545 reset in 43 ms.
Product exploration explored 100000 steps with 4545 reset in 64 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Referendum-COL-0020-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Referendum-COL-0020-LTLCardinality-15 finished in 362 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(p1)))||(p2&&X(G(!p2)))))'
Found a Lengthening insensitive property : Referendum-COL-0020-LTLCardinality-00
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) p2), p2]
Support contains 3 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
[2023-03-17 10:30:30] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-17 10:30:30] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-17 10:30:30] [INFO ] Invariant cache hit.
[2023-03-17 10:30:31] [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-17 10:30:31] [INFO ] Invariant cache hit.
[2023-03-17 10:30:31] [INFO ] Dead Transitions using invariants and state equation in 12 ms found 0 transitions.
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 56 ms. Remains : 3/4 places, 3/3 transitions.
Running random walk in product with property : Referendum-COL-0020-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 0}, { cond=(NOT p2), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(LEQ s0 s1), p0:(LEQ 1 s2), p2:(LEQ 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4545 reset in 40 ms.
Product exploration explored 100000 steps with 4545 reset in 52 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) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X (AND p0 p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 34 factoid took 1348 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (AND p0 p2 p1)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X (AND p0 p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND p0 p2 p1))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 34 factoid took 1514 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2023-03-17 10:30:34] [INFO ] Invariant cache hit.
[2023-03-17 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-17 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:30:34] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-17 10:30:34] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
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.
[2023-03-17 10:30:34] [INFO ] Invariant cache hit.
[2023-03-17 10:30:34] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-17 10:30:34] [INFO ] Invariant cache hit.
[2023-03-17 10:30:34] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-17 10:30:34] [INFO ] Invariant cache hit.
[2023-03-17 10:30:34] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 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) (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 475 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 22 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), true, (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X p0)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 11 factoid took 501 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
[2023-03-17 10:30:35] [INFO ] Invariant cache hit.
[2023-03-17 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-17 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 10:30:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-17 10:30:35] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-17 10:30:35] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4545 reset in 43 ms.
Product exploration explored 100000 steps with 4545 reset in 46 ms.
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.
[2023-03-17 10:30:36] [INFO ] Invariant cache hit.
[2023-03-17 10:30:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-17 10:30:36] [INFO ] Invariant cache hit.
[2023-03-17 10:30:36] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-17 10:30:36] [INFO ] Invariant cache hit.
[2023-03-17 10:30:36] [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 : 3/3 places, 3/3 transitions.
Treatment of property Referendum-COL-0020-LTLCardinality-00 finished in 5715 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((p1||X(X(!p0))))))'
[2023-03-17 10:30:36] [INFO ] Flatten gal took : 1 ms
[2023-03-17 10:30:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-17 10:30:36] [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 30019 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Referendum-COL-0020
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA Referendum-COL-0020-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Referendum-COL-0020-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679049038355

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Referendum-COL-0020-LTLCardinality-03
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Referendum-COL-0020-LTLCardinality-03
lola: result : true
lola: markings : 19
lola: fired transitions : 27
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Referendum-COL-0020-LTLCardinality-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Referendum-COL-0020-LTLCardinality-00
lola: result : true
lola: markings : 507
lola: fired transitions : 1270
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Referendum-COL-0020-LTLCardinality-00: LTL true LTL model checker
Referendum-COL-0020-LTLCardinality-03: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-0020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Referendum-COL-0020, 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 r327-tall-167889199600419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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