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.r265-smll-167863540200564.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 Peterson-COL-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540200564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.1K Feb 25 22:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 22:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 22:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 22:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 22:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 22:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 43K 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 Peterson-COL-3-LTLFireability-00
FORMULA_NAME Peterson-COL-3-LTLFireability-01
FORMULA_NAME Peterson-COL-3-LTLFireability-02
FORMULA_NAME Peterson-COL-3-LTLFireability-03
FORMULA_NAME Peterson-COL-3-LTLFireability-04
FORMULA_NAME Peterson-COL-3-LTLFireability-05
FORMULA_NAME Peterson-COL-3-LTLFireability-06
FORMULA_NAME Peterson-COL-3-LTLFireability-07
FORMULA_NAME Peterson-COL-3-LTLFireability-08
FORMULA_NAME Peterson-COL-3-LTLFireability-09
FORMULA_NAME Peterson-COL-3-LTLFireability-10
FORMULA_NAME Peterson-COL-3-LTLFireability-11
FORMULA_NAME Peterson-COL-3-LTLFireability-12
FORMULA_NAME Peterson-COL-3-LTLFireability-13
FORMULA_NAME Peterson-COL-3-LTLFireability-14
FORMULA_NAME Peterson-COL-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679095677249

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-17 23:28:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 23:28:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 23:28:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-17 23:28:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-17 23:28:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 876 ms
[2023-03-17 23:28:01] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2023-03-17 23:28:01] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 7 ms.
[2023-03-17 23:28:01] [INFO ] Skeletonized 13 HLPN properties in 1 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA Peterson-COL-3-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 221 steps, including 0 resets, run visited all 8 properties in 19 ms. (steps per millisecond=11 )
[2023-03-17 23:28:01] [INFO ] Flatten gal took : 19 ms
[2023-03-17 23:28:01] [INFO ] Flatten gal took : 4 ms
Domain [Process(4), Tour(3), Process(4)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 3)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-17 23:28:01] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 35 ms.
[2023-03-17 23:28:01] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 24 transitions.
FORMULA Peterson-COL-3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-3-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 160 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 21 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:01] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 23:28:01] [INFO ] Computed 15 place invariants in 26 ms
[2023-03-17 23:28:02] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-17 23:28:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:02] [INFO ] Invariant cache hit.
[2023-03-17 23:28:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:02] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2023-03-17 23:28:02] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:02] [INFO ] Invariant cache hit.
[2023-03-17 23:28:02] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1012 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 160 out of 244 places after structural reductions.
[2023-03-17 23:28:02] [INFO ] Flatten gal took : 48 ms
[2023-03-17 23:28:02] [INFO ] Flatten gal took : 49 ms
[2023-03-17 23:28:03] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:28:03] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:03] [INFO ] Invariant cache hit.
[2023-03-17 23:28:03] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-17 23:28:03] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 7 ms returned sat
[2023-03-17 23:28:03] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:28:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 23:28:03] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 23:28:04] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:04] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:04] [INFO ] After 73ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:04] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 7 ms to minimize.
[2023-03-17 23:28:04] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 1 ms to minimize.
[2023-03-17 23:28:04] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-17 23:28:04] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 2 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 2 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 61 places in 85 ms of which 1 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 0 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 0 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2023-03-17 23:28:05] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 1 ms to minimize.
[2023-03-17 23:28:06] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 1 ms to minimize.
[2023-03-17 23:28:06] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 0 ms to minimize.
[2023-03-17 23:28:06] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1961 ms
[2023-03-17 23:28:06] [INFO ] After 2094ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-17 23:28:06] [INFO ] After 2466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 24 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 181 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 172 transition count 212
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 41 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 124/244 places, 212/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 12 ms. (steps per millisecond=3 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 12 ms. (steps per millisecond=3 ) properties seen :2
FORMULA Peterson-COL-3-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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 12 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 19 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:07] [INFO ] Invariant cache hit.
[2023-03-17 23:28:07] [INFO ] Implicit Places using invariants in 144 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 147 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 18 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 230 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s142 1) (GEQ s108 1) (GEQ s125 1) (GEQ s147 1) (GEQ s112 1) (GEQ s129 1) (GEQ s134 1) (GEQ s151 1) (GEQ s116 1) (GEQ s138 1) (GEQ s155 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 6 ms.
FORMULA Peterson-COL-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-00 finished in 490 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 10 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:07] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:07] [INFO ] Invariant cache hit.
[2023-03-17 23:28:07] [INFO ] Implicit Places using invariants in 134 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 136 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (OR (LT s0 1) (LT s189 1)) (OR (LT s2 1) (LT s162 1)) (OR (LT s4 1) (LT s185 1)) (OR (LT s2 1) (LT s159 1)) (OR (LT s6 1) (LT s158 1)) (OR (LT s2 ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 671 ms.
Product exploration explored 100000 steps with 50000 reset in 574 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 198 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-3-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-3-LTLFireability-01 finished in 1769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(X((p1 U p2))&&G(!p1)))))'
Support contains 52 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:09] [INFO ] Invariant cache hit.
[2023-03-17 23:28:09] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-17 23:28:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:09] [INFO ] Invariant cache hit.
[2023-03-17 23:28:09] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:09] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2023-03-17 23:28:09] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:09] [INFO ] Invariant cache hit.
[2023-03-17 23:28:10] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 983 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s3 1) (LT s10 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s2 1) (LT s8 1))), p1:(OR (GEQ s98 1) (GEQ s101 1) (GEQ s104 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 10737 reset in 348 ms.
Stack based approach found an accepted trace after 716 steps with 77 reset with depth 8 and stack size 8 in 14 ms.
FORMULA Peterson-COL-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-02 finished in 1587 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(p0))&&F(p1))))'
Support contains 60 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:10] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:10] [INFO ] Invariant cache hit.
[2023-03-17 23:28:10] [INFO ] Implicit Places using invariants in 127 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 128 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 138 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s11 1) (GEQ s20 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6041 reset in 371 ms.
Stack based approach found an accepted trace after 1896 steps with 102 reset with depth 24 and stack size 24 in 10 ms.
FORMULA Peterson-COL-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-03 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(G((p1 U X(p1))))))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:11] [INFO ] Invariant cache hit.
[2023-03-17 23:28:11] [INFO ] Implicit Places using invariants in 113 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 116 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 125 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 3}], [{ cond=p0, acceptance={} source=9 dest: 4}, { cond=(NOT p0), acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(OR (AND (GEQ s22 1) (GEQ s38 1)) (AND (GEQ s24 1) (GEQ s33 1)) (AND (GEQ s31 1) (GEQ s43 1)) (AND (GEQ s20 1) (GEQ s32 1)) (AND (GEQ s26 1) (GEQ s39 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 295 ms.
Product exploration explored 100000 steps with 2 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 931 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 684 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:28:14] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-17 23:28:14] [INFO ] Computed 11 place invariants in 3 ms
[2023-03-17 23:28:14] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 23:28:14] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:28:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-17 23:28:15] [INFO ] After 203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:15] [INFO ] After 101ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 0 ms to minimize.
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 1 ms to minimize.
[2023-03-17 23:28:15] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 879 ms
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2023-03-17 23:28:16] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2023-03-17 23:28:17] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2023-03-17 23:28:17] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2023-03-17 23:28:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1042 ms
[2023-03-17 23:28:17] [INFO ] After 2128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-17 23:28:17] [INFO ] After 2577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 36 ms.
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 240 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 177 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 168 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 168 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 120 transition count 212
Applied a total of 240 rules in 20 ms. Remains 120 /240 variables (removed 120) and now considering 212/332 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 120/240 places, 212/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 8 ms. (steps per millisecond=4 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 9 ms. (steps per millisecond=4 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p1 (NOT p0))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 972 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 388 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 408 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
[2023-03-17 23:28:19] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:19] [INFO ] Invariant cache hit.
[2023-03-17 23:28:19] [INFO ] [Real]Absence check using 11 positive place invariants in 11 ms returned sat
[2023-03-17 23:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:20] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-17 23:28:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 23:28:20] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 23:28:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:20] [INFO ] [Nat]Absence check using state equation in 179 ms returned sat
[2023-03-17 23:28:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:20] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2023-03-17 23:28:20] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 24 ms.
[2023-03-17 23:28:21] [INFO ] Added : 133 causal constraints over 27 iterations in 774 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:21] [INFO ] Invariant cache hit.
[2023-03-17 23:28:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-17 23:28:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:21] [INFO ] Invariant cache hit.
[2023-03-17 23:28:21] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:22] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2023-03-17 23:28:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:22] [INFO ] Invariant cache hit.
[2023-03-17 23:28:22] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 682 ms. Remains : 240/240 places, 332/332 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 659 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:28:23] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:23] [INFO ] Invariant cache hit.
[2023-03-17 23:28:23] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 23:28:23] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:28:23] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-17 23:28:24] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:24] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:24] [INFO ] After 101ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:24] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-17 23:28:24] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
[2023-03-17 23:28:24] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-17 23:28:24] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-17 23:28:24] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2023-03-17 23:28:24] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 0 ms to minimize.
[2023-03-17 23:28:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 660 ms
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 1 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 0 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 1 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 1 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 1 ms to minimize.
[2023-03-17 23:28:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 904 ms
[2023-03-17 23:28:25] [INFO ] After 1763ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-17 23:28:25] [INFO ] After 2158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 240 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 177 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 168 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 168 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 120 transition count 212
Applied a total of 240 rules in 20 ms. Remains 120 /240 variables (removed 120) and now considering 212/332 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 120/240 places, 212/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 6 ms. (steps per millisecond=6 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 6 ms. (steps per millisecond=6 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 786 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
[2023-03-17 23:28:27] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:27] [INFO ] Invariant cache hit.
[2023-03-17 23:28:28] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-17 23:28:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:28] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-17 23:28:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 23:28:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-03-17 23:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:28] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-17 23:28:28] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:28] [INFO ] [Nat]Added 57 Read/Feed constraints in 14 ms returned sat
[2023-03-17 23:28:28] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 26 ms.
[2023-03-17 23:28:29] [INFO ] Added : 133 causal constraints over 27 iterations in 773 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 374 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Product exploration explored 100000 steps with 3 reset in 280 ms.
Product exploration explored 100000 steps with 3 reset in 353 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 356 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 240 transition count 332
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 45 place count 240 transition count 341
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 85 place count 240 transition count 341
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 112 place count 213 transition count 314
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 139 place count 213 transition count 314
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 174 place count 213 transition count 314
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 201 place count 186 transition count 287
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 228 place count 186 transition count 287
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 228 rules in 40 ms. Remains 186 /240 variables (removed 54) and now considering 287/332 (removed 45) transitions.
[2023-03-17 23:28:31] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-17 23:28:31] [INFO ] Flow matrix only has 263 transitions (discarded 24 similar events)
// Phase 1: matrix 263 rows 186 cols
[2023-03-17 23:28:31] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 23:28:31] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/240 places, 287/332 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 186/240 places, 287/332 transitions.
Support contains 48 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 332/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-17 23:28:31] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 23:28:31] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-17 23:28:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:31] [INFO ] Invariant cache hit.
[2023-03-17 23:28:31] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:32] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-17 23:28:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:32] [INFO ] Invariant cache hit.
[2023-03-17 23:28:32] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 240/240 places, 332/332 transitions.
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 20807 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 4 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-17 23:28:32] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-17 23:28:32] [INFO ] Implicit Places using invariants in 150 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 154 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, p0, p0]
Running random walk in product with property : Peterson-COL-3-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s94 1) (GEQ s97 1) (GEQ s100 1) (GEQ s103 1))], 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 50 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-06 finished in 265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&F(p1))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:32] [INFO ] Invariant cache hit.
[2023-03-17 23:28:32] [INFO ] Implicit Places using invariants in 121 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 124 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 133 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LT s93 1) (LT s92 1) (LT s95 1) (LT s96 1) (LT s99 1) (LT s98 1) (LT s102 1) (LT s101 1)), p0:(AND (OR (LT s5 1) (LT s106 1)) (OR (LT s7 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-07 finished in 330 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))&&(!p0 U !p1))))'
Support contains 64 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:32] [INFO ] Invariant cache hit.
[2023-03-17 23:28:33] [INFO ] Implicit Places using invariants in 88 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1]
Running random walk in product with property : Peterson-COL-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s27 1) (LT s39 1)) (OR (LT s22 1) (LT s41 1)) (OR (LT s22 1) (LT s35 1)) (OR (LT s31 1) (LT s34 1)) (OR (LT s21 1) (LT s32 1)) (OR (LT s31...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 Peterson-COL-3-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-10 finished in 324 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((!p1 U X(p1))))))'
Support contains 44 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:33] [INFO ] Invariant cache hit.
[2023-03-17 23:28:33] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-17 23:28:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:33] [INFO ] Invariant cache hit.
[2023-03-17 23:28:33] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:33] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-17 23:28:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:33] [INFO ] Invariant cache hit.
[2023-03-17 23:28:34] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : Peterson-COL-3-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (OR (LT s0 1) (LT s4 1)) (OR (LT s3 1) (LT s10 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s2 1) (LT s8 1))), p0:(AND (LT s130 1) (LT s131 1) (LT s128 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 475 ms.
Product exploration explored 100000 steps with 50000 reset in 497 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 4 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-COL-3-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-COL-3-LTLFireability-12 finished in 1998 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)||X(X(p2)))))'
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-17 23:28:35] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-17 23:28:35] [INFO ] Invariant cache hit.
[2023-03-17 23:28:35] [INFO ] Implicit Places using invariants in 124 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 126 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 240/244 places, 332/332 transitions.
Applied a total of 0 rules in 2 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 131 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : Peterson-COL-3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s22 1)) (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s11 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s23 1)) (AND (GEQ s11 1) (GEQ s20 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 208 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-14 finished in 552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)&&(X(F((p1&&F(p0))))||p2)))))'
Support contains 16 out of 244 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 74 rules applied. Total rules applied 137 place count 181 transition count 258
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 148 place count 170 transition count 258
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 148 place count 170 transition count 214
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 236 place count 126 transition count 214
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 248 place count 120 transition count 208
Applied a total of 248 rules in 26 ms. Remains 120 /244 variables (removed 124) and now considering 208/332 (removed 124) transitions.
[2023-03-17 23:28:35] [INFO ] Flow matrix only has 184 transitions (discarded 24 similar events)
// Phase 1: matrix 184 rows 120 cols
[2023-03-17 23:28:35] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 23:28:36] [INFO ] Implicit Places using invariants in 103 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/244 places, 208/332 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 208/208 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 116/244 places, 208/332 transitions.
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Peterson-COL-3-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND (NOT p2) p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s50 1) (GEQ s53 1) (GEQ s56 1) (GEQ s59 1)), p0:(OR (GEQ s72 1) (GEQ s64 1) (GEQ s68 1) (GEQ s73 1) (GEQ s65 1) (GEQ s69 1) (GEQ s70 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1315 reset in 365 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-15 finished in 745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(G((p1 U X(p1))))))'
Found a Lengthening insensitive property : Peterson-COL-3-LTLFireability-04
Stuttering acceptance computed with spot in 337 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Support contains 48 out of 244 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 244 transition count 269
Reduce places removed 63 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 72 rules applied. Total rules applied 135 place count 181 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 144 place count 172 transition count 260
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 144 place count 172 transition count 212
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 240 place count 124 transition count 212
Applied a total of 240 rules in 15 ms. Remains 124 /244 variables (removed 120) and now considering 212/332 (removed 120) transitions.
[2023-03-17 23:28:37] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 124 cols
[2023-03-17 23:28:37] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-17 23:28:37] [INFO ] Implicit Places using invariants in 99 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 120/244 places, 212/332 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 122 ms. Remains : 120/244 places, 212/332 transitions.
Running random walk in product with property : Peterson-COL-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(NOT p1), acceptance={} source=8 dest: 3}], [{ cond=p0, acceptance={} source=9 dest: 4}, { cond=(NOT p0), acceptance={} source=9 dest: 9}]], initial=2, aps=[p1:(OR (AND (GEQ s14 1) (GEQ s30 1)) (AND (GEQ s16 1) (GEQ s25 1)) (AND (GEQ s23 1) (GEQ s35 1)) (AND (GEQ s12 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s31 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 281 ms.
Product exploration explored 100000 steps with 0 reset in 300 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 761 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:28:39] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
// Phase 1: matrix 188 rows 120 cols
[2023-03-17 23:28:39] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 23:28:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 23:28:39] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:28:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 23:28:39] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:39] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:39] [INFO ] After 73ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 11 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 0 ms to minimize.
[2023-03-17 23:28:39] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 550 ms
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 3 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 3 ms to minimize.
[2023-03-17 23:28:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 490 ms
[2023-03-17 23:28:40] [INFO ] After 1177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-17 23:28:40] [INFO ] After 1428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 120/120 places, 212/212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 8 ms. (steps per millisecond=4 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 9 ms. (steps per millisecond=4 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p1 (NOT p0))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 783 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 503 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 391 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
[2023-03-17 23:28:42] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:42] [INFO ] Invariant cache hit.
[2023-03-17 23:28:42] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 23:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:42] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-17 23:28:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 23:28:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 23:28:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:43] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-17 23:28:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:43] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2023-03-17 23:28:43] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-17 23:28:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-17 23:28:43] [INFO ] Computed and/alt/rep : 163/365/163 causal constraints (skipped 21 transitions) in 16 ms.
[2023-03-17 23:28:43] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2023-03-17 23:28:43] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2023-03-17 23:28:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2023-03-17 23:28:43] [INFO ] Added : 62 causal constraints over 13 iterations in 365 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-17 23:28:43] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:43] [INFO ] Invariant cache hit.
[2023-03-17 23:28:43] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-17 23:28:43] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:43] [INFO ] Invariant cache hit.
[2023-03-17 23:28:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:43] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-17 23:28:43] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:43] [INFO ] Invariant cache hit.
[2023-03-17 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 120/120 places, 212/212 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 581 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 23:28:45] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:45] [INFO ] Invariant cache hit.
[2023-03-17 23:28:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-17 23:28:45] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 23:28:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 23:28:45] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:45] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:45] [INFO ] After 65ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-03-17 23:28:45] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 524 ms
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 3 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-17 23:28:46] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 0 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 0 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2023-03-17 23:28:47] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 1394 ms
[2023-03-17 23:28:47] [INFO ] After 2044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-17 23:28:47] [INFO ] After 2287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 120/120 places, 212/212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 6 ms. (steps per millisecond=6 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 6 ms. (steps per millisecond=6 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p1 (NOT p0))), (F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 677 ms. Reduced automaton from 10 states, 24 edges and 2 AP (stutter sensitive) to 10 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Stuttering acceptance computed with spot in 406 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
[2023-03-17 23:28:49] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:49] [INFO ] Invariant cache hit.
[2023-03-17 23:28:49] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 23:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:49] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-17 23:28:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-17 23:28:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-17 23:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-17 23:28:49] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-17 23:28:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:49] [INFO ] [Nat]Added 57 Read/Feed constraints in 12 ms returned sat
[2023-03-17 23:28:49] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-17 23:28:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-17 23:28:49] [INFO ] Computed and/alt/rep : 163/365/163 causal constraints (skipped 21 transitions) in 16 ms.
[2023-03-17 23:28:50] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
[2023-03-17 23:28:50] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-17 23:28:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-17 23:28:50] [INFO ] Added : 62 causal constraints over 13 iterations in 381 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 452 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Product exploration explored 100000 steps with 0 reset in 286 ms.
Product exploration explored 100000 steps with 1 reset in 319 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 336 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1), (NOT p1), true, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0]
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-17 23:28:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-17 23:28:51] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:51] [INFO ] Invariant cache hit.
[2023-03-17 23:28:51] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 120/120 places, 212/212 transitions.
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 212/212 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 212/212 (removed 0) transitions.
[2023-03-17 23:28:51] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:51] [INFO ] Invariant cache hit.
[2023-03-17 23:28:52] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-17 23:28:52] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:52] [INFO ] Invariant cache hit.
[2023-03-17 23:28:52] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-17 23:28:52] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-17 23:28:52] [INFO ] Flow matrix only has 188 transitions (discarded 24 similar events)
[2023-03-17 23:28:52] [INFO ] Invariant cache hit.
[2023-03-17 23:28:52] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 120/120 places, 212/212 transitions.
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 15820 ms.
[2023-03-17 23:28:52] [INFO ] Flatten gal took : 27 ms
[2023-03-17 23:28:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-17 23:28:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 244 places, 332 transitions and 1016 arcs took 3 ms.
Total runtime 52200 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2223/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Peterson-COL-3-LTLFireability-04

BK_STOP 1679095788113

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Peterson-COL-3-LTLFireability-04
ltl formula formula --ltl=/tmp/2223/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 244 places, 332 transitions and 1016 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2223/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2223/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2223/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2223/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="Peterson-COL-3"
export BK_EXAMINATION="LTLFireability"
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 Peterson-COL-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540200564"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-3.tgz
mv Peterson-COL-3 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;