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.r263-smll-167863538300467.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 PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538300467
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.8K Feb 26 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 01:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 01:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 01:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 01:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678796459616

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=PermAdmissibility-COL-02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 12:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 12:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 12:21:03] [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-14 12:21:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 12:21:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1058 ms
[2023-03-14 12:21:04] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 35 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 12:21:04] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 9 ms.
[2023-03-14 12:21:04] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PermAdmissibility-COL-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
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 10000 steps, including 208 resets, run finished after 669 ms. (steps per millisecond=14 ) properties (out of 31) seen :24
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 16 rows 40 cols
[2023-03-14 12:21:06] [INFO ] Computed 24 place invariants in 10 ms
[2023-03-14 12:21:07] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 26 ms returned sat
[2023-03-14 12:21:07] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:4
[2023-03-14 12:21:07] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-14 12:21:07] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA PermAdmissibility-COL-02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 12:21:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-14 12:21:07] [INFO ] Flatten gal took : 57 ms
[2023-03-14 12:21:07] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 12:21:07] [INFO ] Flatten gal took : 9 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-14 12:21:07] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 12 ms.
[2023-03-14 12:21:07] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 21 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 34 transition count 16
Applied a total of 6 rules in 11 ms. Remains 34 /40 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 34 cols
[2023-03-14 12:21:07] [INFO ] Computed 18 place invariants in 7 ms
[2023-03-14 12:21:07] [INFO ] Implicit Places using invariants in 124 ms returned [7, 11, 18, 29, 30]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 128 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 29/40 places, 16/16 transitions.
Support contains 21 out of 29 places after structural reductions.
[2023-03-14 12:21:07] [INFO ] Flatten gal took : 7 ms
[2023-03-14 12:21:07] [INFO ] Flatten gal took : 8 ms
[2023-03-14 12:21:07] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 208 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10000 steps, including 158 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 29 cols
[2023-03-14 12:21:08] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-14 12:21:08] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2023-03-14 12:21:08] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-14 12:21:08] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-14 12:21:08] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
Computed a total of 29 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 16
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' '!(X(G(p0)))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 16
Applied a total of 4 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 12:21:08] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 12:21:08] [INFO ] Implicit Places using invariants in 96 ms returned [4, 5, 12, 13, 17, 21]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 99 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/29 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 19/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 312 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LEQ 1 s3) (AND (LEQ s9 s12) (GT s11 s7)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-00 finished in 503 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 (!(p0 U !(F(p1)&&p2))||p1)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 55 edges and 29 vertex of which 27 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 27 /29 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 27 cols
[2023-03-14 12:21:08] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-14 12:21:09] [INFO ] Implicit Places using invariants in 115 ms returned [6, 7, 11, 14, 15, 18, 19, 23]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 122 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/29 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 18 transition count 9
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 11 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 11 transition count 5
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 8 transition count 5
Applied a total of 20 rules in 12 ms. Remains 8 /19 variables (removed 11) and now considering 5/16 (removed 11) transitions.
// Phase 1: matrix 5 rows 8 cols
[2023-03-14 12:21:09] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-14 12:21:09] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-14 12:21:09] [INFO ] Invariant cache hit.
[2023-03-14 12:21:09] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/29 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 221 ms. Remains : 8/29 places, 5/16 transitions.
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), true, (NOT p0), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s0), p0:(LEQ 1 s6), p2:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 9090 reset in 601 ms.
Product exploration explored 100000 steps with 9090 reset in 293 ms.
Computed a total of 8 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), true, (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1350 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p1) p2)), (X (AND (NOT p1) p0 p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p2))), true, (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 25 factoid took 1533 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
[2023-03-14 12:21:13] [INFO ] Invariant cache hit.
[2023-03-14 12:21:13] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:21:13] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 12:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:21:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-14 12:21:13] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-14 12:21:13] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-14 12:21:13] [INFO ] Invariant cache hit.
[2023-03-14 12:21:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-14 12:21:13] [INFO ] Invariant cache hit.
[2023-03-14 12:21:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-14 12:21:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-14 12:21:13] [INFO ] Invariant cache hit.
[2023-03-14 12:21:13] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 8/8 places, 5/5 transitions.
Computed a total of 8 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 5
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 221 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
[2023-03-14 12:21:14] [INFO ] Invariant cache hit.
[2023-03-14 12:21:14] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 12:21:14] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-14 12:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 12:21:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-14 12:21:14] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-14 12:21:14] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 52 ms :[(NOT p1)]
Product exploration explored 100000 steps with 9090 reset in 147 ms.
Product exploration explored 100000 steps with 9090 reset in 152 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Graph (complete) has 9 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 3
Applied a total of 3 rules in 8 ms. Remains 5 /8 variables (removed 3) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 5 cols
[2023-03-14 12:21:14] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 12:21:14] [INFO ] Implicit Places using invariants in 64 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/8 places, 3/5 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2 transition count 1
Applied a total of 2 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 1/3 (removed 2) transitions.
// Phase 1: matrix 1 rows 2 cols
[2023-03-14 12:21:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-14 12:21:15] [INFO ] Invariant cache hit.
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/8 places, 1/5 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 2/8 places, 1/5 transitions.
Treatment of property PermAdmissibility-COL-02-LTLCardinality-01 finished in 6159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(G(p1)) U (p0&&X(G(p1))))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 16
Applied a total of 4 rules in 1 ms. Remains 25 /29 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 12:21:15] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants in 63 ms returned [4, 5, 9, 11, 12, 13, 16, 17, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 64 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/29 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 16/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 s8), p1:(GT s3 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-04 finished in 328 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(G((p0||G(p1))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 55 edges and 29 vertex of which 25 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:21:15] [INFO ] Invariant cache hit.
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants in 55 ms returned [9, 11, 12, 13, 16, 17, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 57 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/29 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 17 transition count 11
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 10 transition count 8
Applied a total of 14 rules in 6 ms. Remains 10 /18 variables (removed 8) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-14 12:21:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-14 12:21:15] [INFO ] Invariant cache hit.
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/29 places, 8/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 10/29 places, 8/16 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-05 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: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 2 s5), p1:(GT s4 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-05 finished in 317 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 G(p1)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 55 edges and 29 vertex of which 22 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 4 ms. Remains 22 /29 variables (removed 7) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-14 12:21:15] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants in 66 ms returned [6, 9, 10, 13, 14, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 15 transition count 10
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 11 transition count 9
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 11 transition count 6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 8 transition count 6
Applied a total of 14 rules in 3 ms. Remains 8 /16 variables (removed 8) and now considering 6/14 (removed 8) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-14 12:21:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-14 12:21:15] [INFO ] Invariant cache hit.
[2023-03-14 12:21:15] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/29 places, 6/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 8/29 places, 6/16 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 s1), p0:(LEQ s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 99 steps with 30 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-06 finished in 322 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(p1)&&p0)))'
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 26 transition count 16
Applied a total of 3 rules in 1 ms. Remains 26 /29 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2023-03-14 12:21:16] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-14 12:21:16] [INFO ] Implicit Places using invariants in 64 ms returned [5, 6, 10, 12, 14, 18, 22]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 66 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 19/29 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 70 ms. Remains : 19/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s0 s12), p0:(AND (LEQ 3 s9) (OR (GT s12 s14) (LEQ s12 s14)))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-08 finished in 255 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(G(p0)) U (!p0||X(X(p1)))))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 26 transition count 16
Applied a total of 3 rules in 0 ms. Remains 26 /29 variables (removed 3) and now considering 16/16 (removed 0) transitions.
[2023-03-14 12:21:16] [INFO ] Invariant cache hit.
[2023-03-14 12:21:16] [INFO ] Implicit Places using invariants in 62 ms returned [5, 6, 10, 12, 13, 17, 18, 22]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 63 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/29 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 18/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 380 ms :[(AND p0 (NOT p1)), false, (AND p0 (NOT p1)), false, false, (AND p0 (NOT p1)), false]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}, { cond=p0, acceptance={1} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}], [{ cond=p0, acceptance={1} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(GT 1 s0), p1:(LEQ s2 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28562 reset in 266 ms.
Product exploration explored 100000 steps with 28574 reset in 245 ms.
Computed a total of 18 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 16
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 p0 p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-10 finished in 1310 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 1 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 55 edges and 29 vertex of which 25 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 25 /29 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-14 12:21:17] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-14 12:21:17] [INFO ] Implicit Places using invariants in 70 ms returned [4, 5, 9, 11, 12, 13, 16, 17, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 86 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 16/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 3
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 3 transition count 2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 2 transition count 2
Applied a total of 26 rules in 3 ms. Remains 2 /16 variables (removed 14) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-14 12:21:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-14 12:21:17] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-14 12:21:17] [INFO ] Invariant cache hit.
[2023-03-14 12:21:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/29 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 141 ms. Remains : 2/29 places, 2/16 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-14 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:(GT 1 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]]
Product exploration explored 100000 steps with 22214 reset in 205 ms.
Product exploration explored 100000 steps with 22232 reset in 245 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 : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-14 finished in 914 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 55 edges and 29 vertex of which 22 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 5 ms. Remains 22 /29 variables (removed 7) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2023-03-14 12:21:18] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-14 12:21:18] [INFO ] Implicit Places using invariants in 77 ms returned [6, 8, 9, 10, 13, 18]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 88 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 15 transition count 7
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 7 transition count 5
Applied a total of 16 rules in 4 ms. Remains 7 /16 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-14 12:21:18] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-14 12:21:18] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-14 12:21:18] [INFO ] Invariant cache hit.
[2023-03-14 12:21:18] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/29 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 7/29 places, 5/16 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s2 s3)], 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 10 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-15 finished in 254 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 (!(p0 U !(F(p1)&&p2))||p1)))'
[2023-03-14 12:21:19] [INFO ] Flatten gal took : 25 ms
[2023-03-14 12:21:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-14 12:21:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 16 transitions and 60 arcs took 1 ms.
Total runtime 15689 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PermAdmissibility-COL-02
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLCardinality

FORMULA PermAdmissibility-COL-02-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678796480629

--------------------
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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: RELEASE
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 PermAdmissibility-COL-02-LTLCardinality-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for PermAdmissibility-COL-02-LTLCardinality-01
lola: result : true
lola: markings : 227
lola: fired transitions : 327
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PermAdmissibility-COL-02-LTLCardinality-01: 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="PermAdmissibility-COL-02"
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 PermAdmissibility-COL-02, 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 r263-smll-167863538300467"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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