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.r297-tall-167873949800011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PhaseVariation-PT-D02CS100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873949800011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.7K Feb 26 15:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 15:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 15:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 15:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 9 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 61K 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 PhaseVariation-PT-D02CS100-LTLCardinality-00
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-01
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-02
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-03
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-04
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-05
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-06
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-07
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-08
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-09
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-10
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-11
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-12
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-13
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-14
FORMULA_NAME PhaseVariation-PT-D02CS100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679428375596

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhaseVariation-PT-D02CS100
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 19:52:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 19:52:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 19:52:57] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-21 19:52:57] [INFO ] Transformed 14 places.
[2023-03-21 19:52:57] [INFO ] Transformed 65 transitions.
[2023-03-21 19:52:57] [INFO ] Parsed PT model containing 14 places and 65 transitions and 443 arcs in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 10 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:52:57] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:52:57] [INFO ] Computed 5 place invariants in 7 ms
[2023-03-21 19:52:57] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
[2023-03-21 19:52:57] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:57] [INFO ] Invariant cache hit.
[2023-03-21 19:52:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 19:52:57] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:57] [INFO ] Invariant cache hit.
[2023-03-21 19:52:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:52:57] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-21 19:52:57] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:57] [INFO ] Invariant cache hit.
[2023-03-21 19:52:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 367 ms. Remains : 14/14 places, 65/65 transitions.
Support contains 14 out of 14 places after structural reductions.
[2023-03-21 19:52:58] [INFO ] Flatten gal took : 28 ms
[2023-03-21 19:52:58] [INFO ] Flatten gal took : 11 ms
[2023-03-21 19:52:58] [INFO ] Input system was already deterministic with 65 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 21) seen :18
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-21 19:52:58] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:58] [INFO ] Invariant cache hit.
[2023-03-21 19:52:58] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-21 19:52:58] [INFO ] After 53ms SMT Verify possible using all constraints in real 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 11 simplifications.
Computed a total of 14 stabilizing places and 65 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 transition count 65
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(F(p0)))'
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:52:58] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:58] [INFO ] Invariant cache hit.
[2023-03-21 19:52:58] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
[2023-03-21 19:52:58] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:58] [INFO ] Invariant cache hit.
[2023-03-21 19:52:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-21 19:52:58] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:52:58] [INFO ] Invariant cache hit.
[2023-03-21 19:52:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:52:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 7 transition count 6
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 5 transition count 4
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 5 transition count 4
Applied a total of 69 rules in 4 ms. Remains 5 /13 variables (removed 8) and now considering 4/65 (removed 61) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-21 19:52:58] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 19:52:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-21 19:52:58] [INFO ] Invariant cache hit.
[2023-03-21 19:52:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:52:59] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 5/14 places, 4/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 196 ms. Remains : 5/14 places, 4/65 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 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 10012 reset in 225 ms.
Product exploration explored 100000 steps with 10011 reset in 149 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 177 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 28 ms :[(NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 166 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 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-00 finished in 1675 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 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 14 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:00] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 19:53:00] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2023-03-21 19:53:00] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-21 19:53:00] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
[2023-03-21 19:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 68 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 7 transition count 6
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 6 transition count 5
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 6 transition count 5
Applied a total of 67 rules in 3 ms. Remains 6 /13 variables (removed 7) and now considering 5/65 (removed 60) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-21 19:53:00] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
[2023-03-21 19:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/14 places, 5/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 6/14 places, 5/65 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 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 100 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-01 finished in 222 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)||(F((p1&&X(p1)))&&F(!p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:00] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:00] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 19:53:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-03-21 19:53:00] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 19:53:00] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
[2023-03-21 19:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 9 transition count 8
Applied a total of 61 rules in 1 ms. Remains 9 /13 variables (removed 4) and now considering 8/65 (removed 57) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-21 19:53:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-21 19:53:00] [INFO ] Invariant cache hit.
[2023-03-21 19:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 9/14 places, 8/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 9/14 places, 8/65 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p1), p1, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GT s1 s0), p1:(GT 3 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8427 reset in 184 ms.
Product exploration explored 100000 steps with 8320 reset in 140 ms.
Computed a total of 9 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 558 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[p1, p1]
Finished random walk after 136 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 584 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 52 ms :[p1]
Stuttering acceptance computed with spot in 42 ms :[p1]
[2023-03-21 19:53:02] [INFO ] Invariant cache hit.
Proved EG p1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (G p1)]
Property proved to be false thanks to negative knowledge :(G p1)
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-02 finished in 2498 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))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 8 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:03] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-21 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:03] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-21 19:53:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 193 ms. Remains : 14/14 places, 65/65 transitions.
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-04 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}]], initial=1, aps=[p0:(OR (GT s12 s0) (LEQ 1 s9))], 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][true, true]]
Entered a terminal (fully accepting) state of product in 95 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-04 finished in 264 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&&F(p1))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 11 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-21 19:53:03] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:03] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 95 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 8 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 7 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 7 transition count 6
Applied a total of 65 rules in 4 ms. Remains 7 /13 variables (removed 6) and now considering 6/65 (removed 59) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-21 19:53:03] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 19:53:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 19:53:03] [INFO ] Invariant cache hit.
[2023-03-21 19:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:03] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/14 places, 6/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 210 ms. Remains : 7/14 places, 6/65 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ s2 s1), p0:(LEQ 3 s0)], 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, null][true, true]]
Product exploration explored 100000 steps with 2348 reset in 104 ms.
Product exploration explored 100000 steps with 2338 reset in 105 ms.
Computed a total of 7 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 6
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 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 424 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10042 steps, including 92 resets, run finished after 14 ms. (steps per millisecond=717 ) properties (out of 3) seen :2
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 428 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 19:53:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:53:05] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-21 19:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:05] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-21 19:53:05] [INFO ] Computed and/alt/rep : 1/5/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 19:53:05] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p1) p0)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-05 finished in 1961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:05] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 19:53:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-21 19:53:05] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-21 19:53:05] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 67 place count 6 transition count 5
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 4 transition count 3
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 4 transition count 3
Applied a total of 71 rules in 3 ms. Remains 4 /13 variables (removed 9) and now considering 3/65 (removed 62) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-21 19:53:05] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4/14 places, 3/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 172 ms. Remains : 4/14 places, 3/65 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-07 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:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 0 ms.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-07 finished in 267 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)&&F(G(p1)))))'
Support contains 3 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 7 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:05] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 19:53:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-21 19:53:05] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-21 19:53:05] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants and state equation in 34 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 66 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 8 transition count 7
Applied a total of 63 rules in 3 ms. Remains 8 /13 variables (removed 5) and now considering 7/65 (removed 58) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 19:53:05] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-21 19:53:05] [INFO ] Invariant cache hit.
[2023-03-21 19:53:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:05] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/14 places, 7/65 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 8/14 places, 7/65 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(LEQ s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1661 reset in 87 ms.
Product exploration explored 100000 steps with 1653 reset in 96 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
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 p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 269 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 463 steps, including 4 resets, run visited all 2 properties in 2 ms. (steps per millisecond=231 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 7 factoid took 340 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-21 19:53:07] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
[2023-03-21 19:53:07] [INFO ] Invariant cache hit.
[2023-03-21 19:53:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 19:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:53:07] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-21 19:53:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 19:53:07] [INFO ] Computed and/alt/rep : 1/6/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 19:53:07] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-10 finished in 1742 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(G(p0)) U (p1&&G(F(p1)))) U G(p0))))'
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:07] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 19:53:07] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-21 19:53:07] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:07] [INFO ] Invariant cache hit.
[2023-03-21 19:53:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-21 19:53:07] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:07] [INFO ] Invariant cache hit.
[2023-03-21 19:53:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 67 place count 6 transition count 5
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 4 transition count 3
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 4 transition count 3
Applied a total of 71 rules in 2 ms. Remains 4 /13 variables (removed 9) and now considering 3/65 (removed 62) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-21 19:53:07] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 19:53:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-21 19:53:07] [INFO ] Invariant cache hit.
[2023-03-21 19:53:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 4/14 places, 3/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 4/14 places, 3/65 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s3), p1:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 980 reset in 67 ms.
Product exploration explored 100000 steps with 980 reset in 79 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 497 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10056 steps, including 93 resets, run finished after 11 ms. (steps per millisecond=914 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:53:08] [INFO ] Invariant cache hit.
[2023-03-21 19:53:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 19:53:08] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 752 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
[2023-03-21 19:53:09] [INFO ] Invariant cache hit.
[2023-03-21 19:53:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 19:53:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:53:09] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-21 19:53:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 19:53:09] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 19:53:09] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 19:53:09] [INFO ] Invariant cache hit.
[2023-03-21 19:53:09] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2023-03-21 19:53:09] [INFO ] Invariant cache hit.
[2023-03-21 19:53:09] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 19:53:09] [INFO ] Invariant cache hit.
[2023-03-21 19:53:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-21 19:53:09] [INFO ] Invariant cache hit.
[2023-03-21 19:53:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 4/4 places, 3/3 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 288 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 178 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 293 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 169 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
[2023-03-21 19:53:11] [INFO ] Invariant cache hit.
[2023-03-21 19:53:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 19:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:53:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-21 19:53:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:11] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 19:53:11] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 19:53:11] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 981 reset in 79 ms.
Product exploration explored 100000 steps with 981 reset in 68 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT 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.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
[2023-03-21 19:53:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 4/4 places, 3/3 transitions.
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-12 finished in 4878 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&&G(F(p1)))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:12] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:12] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 19:53:12] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
[2023-03-21 19:53:12] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-21 19:53:12] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 63 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 64 place count 8 transition count 6
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 7 transition count 5
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 7 transition count 5
Applied a total of 66 rules in 3 ms. Remains 7 /13 variables (removed 6) and now considering 5/65 (removed 60) transitions.
// Phase 1: matrix 5 rows 7 cols
[2023-03-21 19:53:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 7/14 places, 5/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 7/14 places, 5/65 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s3 s4), p1:(OR (GT 2 s0) (GT 3 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 1 steps with 0 reset in 0 ms.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-13 finished in 355 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 U G(p1))||(X(G(p0)) U G(p2))))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:12] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:12] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 19:53:12] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-21 19:53:12] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 19:53:12] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 8 transition count 7
Applied a total of 63 rules in 1 ms. Remains 8 /13 variables (removed 5) and now considering 7/65 (removed 58) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 19:53:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-21 19:53:12] [INFO ] Invariant cache hit.
[2023-03-21 19:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:12] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8/14 places, 7/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 8/14 places, 7/65 transitions.
Stuttering acceptance computed with spot in 447 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (AND p0 (NOT p2)), (NOT p1), (AND p0 (NOT p2) (NOT p1))]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 8}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 9}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 10}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 11}], [{ cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(AND p1 p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=true, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}], [{ cond=(NOT p1), acceptance={} source=10 dest: 8}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=11 dest: 9}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p1 p0 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(LEQ s2 s5), p0:(LEQ 1 s1), p2:(LEQ 2 s0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 1 ms.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-14 finished in 644 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(G(p0)) U p1)))'
Support contains 4 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:13] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-21 19:53:13] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-21 19:53:13] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:13] [INFO ] Invariant cache hit.
[2023-03-21 19:53:13] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 19:53:13] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:13] [INFO ] Invariant cache hit.
[2023-03-21 19:53:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:13] [INFO ] Implicit Places using invariants and state equation in 38 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 8 transition count 7
Applied a total of 63 rules in 2 ms. Remains 8 /13 variables (removed 5) and now considering 7/65 (removed 58) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-21 19:53:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 19:53:13] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-21 19:53:13] [INFO ] Invariant cache hit.
[2023-03-21 19:53:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:13] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8/14 places, 7/65 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 178 ms. Remains : 8/14 places, 7/65 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT s0 s1) (GT s3 s2)), p0:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 204 steps with 1 reset in 1 ms.
FORMULA PhaseVariation-PT-D02CS100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-15 finished in 321 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(G(p0)) U (p1&&G(F(p1)))) U G(p0))))'
Found a Lengthening insensitive property : PhaseVariation-PT-D02CS100-LTLCardinality-12
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 14/14 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 14 /14 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-21 19:53:13] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
// Phase 1: matrix 9 rows 14 cols
[2023-03-21 19:53:13] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-21 19:53:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-21 19:53:13] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:13] [INFO ] Invariant cache hit.
[2023-03-21 19:53:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-21 19:53:14] [INFO ] Flow matrix only has 9 transitions (discarded 56 similar events)
[2023-03-21 19:53:14] [INFO ] Invariant cache hit.
[2023-03-21 19:53:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 65 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/14 places, 65/65 transitions.
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 56 place count 13 transition count 9
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 67 place count 6 transition count 5
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 69 place count 4 transition count 3
Iterating global reduction 1 with 2 rules applied. Total rules applied 71 place count 4 transition count 3
Applied a total of 71 rules in 3 ms. Remains 4 /13 variables (removed 9) and now considering 3/65 (removed 62) transitions.
// Phase 1: matrix 3 rows 4 cols
[2023-03-21 19:53:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-21 19:53:14] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-21 19:53:14] [INFO ] Invariant cache hit.
[2023-03-21 19:53:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:14] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 4/14 places, 3/65 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 156 ms. Remains : 4/14 places, 3/65 transitions.
Running random walk in product with property : PhaseVariation-PT-D02CS100-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 s3), p1:(LEQ 3 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 981 reset in 67 ms.
Product exploration explored 100000 steps with 981 reset in 74 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 595 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10056 steps, including 93 resets, run finished after 6 ms. (steps per millisecond=1676 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10052 steps, including 61 resets, run finished after 13 ms. (steps per millisecond=773 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 19:53:15] [INFO ] Invariant cache hit.
[2023-03-21 19:53:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-21 19:53:15] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 12 factoid took 517 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
[2023-03-21 19:53:16] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-21 19:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:53:16] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-21 19:53:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-21 19:53:16] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-21 19:53:16] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 19:53:16] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2023-03-21 19:53:16] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-21 19:53:16] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-21 19:53:16] [INFO ] Invariant cache hit.
[2023-03-21 19:53:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 4/4 places, 3/3 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 253 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 165 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Finished random walk after 105 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X (X p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 269 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 173 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:17] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-21 19:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 19:53:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-21 19:53:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:17] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-21 19:53:17] [INFO ] Computed and/alt/rep : 1/2/1 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-21 19:53:17] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 980 reset in 67 ms.
Product exploration explored 100000 steps with 980 reset in 62 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT 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.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:17] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-03-21 19:53:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:17] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 4/4 places, 3/3 transitions.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:17] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 19:53:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-21 19:53:17] [INFO ] Invariant cache hit.
[2023-03-21 19:53:18] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 4/4 places, 3/3 transitions.
Treatment of property PhaseVariation-PT-D02CS100-LTLCardinality-12 finished in 4444 ms.
[2023-03-21 19:53:18] [INFO ] Flatten gal took : 12 ms
[2023-03-21 19:53:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-21 19:53:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 14 places, 65 transitions and 443 arcs took 2 ms.
Total runtime 20668 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2000/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PhaseVariation-PT-D02CS100-LTLCardinality-12

BK_STOP 1679428400363

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name PhaseVariation-PT-D02CS100-LTLCardinality-12
ltl formula formula --ltl=/tmp/2000/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 14 places, 65 transitions and 443 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2000/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2000/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2000/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2000/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is PhaseVariation-PT-D02CS100, 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 r297-tall-167873949800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhaseVariation-PT-D02CS100.tgz
mv PhaseVariation-PT-D02CS100 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 ;