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.r261-smll-167863536500564.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 itstools
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 r261-smll-167863536500564
=====================================================================

--------------------
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 1679005145498

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-3
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202303021504
[2023-03-16 22:19:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-16 22:19:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 22:19:09] [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-16 22:19:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 22:19:10] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1052 ms
[2023-03-16 22:19:10] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 51 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
[2023-03-16 22:19:10] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 8 ms.
[2023-03-16 22:19:10] [INFO ] Skeletonized 13 HLPN properties in 2 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 116 steps, including 0 resets, run visited all 8 properties in 25 ms. (steps per millisecond=4 )
[2023-03-16 22:19:10] [INFO ] Flatten gal took : 27 ms
[2023-03-16 22:19:10] [INFO ] Flatten gal took : 5 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-16 22:19:11] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions 1112 arcs in 56 ms.
[2023-03-16 22:19:11] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 12 places in 5 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 31 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-16 22:19:11] [INFO ] Computed 15 place invariants in 37 ms
[2023-03-16 22:19:11] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-16 22:19:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:11] [INFO ] Invariant cache hit.
[2023-03-16 22:19:11] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:11] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
[2023-03-16 22:19:11] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:11] [INFO ] Invariant cache hit.
[2023-03-16 22:19:12] [INFO ] Dead Transitions using invariants and state equation in 498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 244/244 places, 332/332 transitions.
Support contains 160 out of 244 places after structural reductions.
[2023-03-16 22:19:12] [INFO ] Flatten gal took : 81 ms
[2023-03-16 22:19:12] [INFO ] Flatten gal took : 72 ms
[2023-03-16 22:19:12] [INFO ] Input system was already deterministic with 332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 14) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 22:19:13] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:13] [INFO ] Invariant cache hit.
[2023-03-16 22:19:13] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-16 22:19:13] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-16 22:19:13] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 22:19:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-16 22:19:13] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-16 22:19:13] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 22:19:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:14] [INFO ] After 64ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 22:19:14] [INFO ] Deduced a trap composed of 73 places in 152 ms of which 6 ms to minimize.
[2023-03-16 22:19:14] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 1 ms to minimize.
[2023-03-16 22:19:14] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2023-03-16 22:19:14] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 2 ms to minimize.
[2023-03-16 22:19:14] [INFO ] Deduced a trap composed of 31 places in 153 ms of which 2 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 1 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 0 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 0 ms to minimize.
[2023-03-16 22:19:15] [INFO ] Deduced a trap composed of 73 places in 219 ms of which 1 ms to minimize.
[2023-03-16 22:19:16] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 0 ms to minimize.
[2023-03-16 22:19:16] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 1 ms to minimize.
[2023-03-16 22:19:16] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 1 ms to minimize.
[2023-03-16 22:19:16] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2409 ms
[2023-03-16 22:19:16] [INFO ] After 2556ms 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-16 22:19:16] [INFO ] After 2914ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 16 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 9 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 81 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 81 ms. Remains : 124/244 places, 212/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 392 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 10 ms. (steps per millisecond=3 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 10 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 34 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:17] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:17] [INFO ] Invariant cache hit.
[2023-03-16 22:19:17] [INFO ] Implicit Places using invariants in 159 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 172 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 33 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 239 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 306 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 2 ms.
FORMULA Peterson-COL-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-3-LTLFireability-00 finished in 642 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 12 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:18] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:18] [INFO ] Invariant cache hit.
[2023-03-16 22:19:18] [INFO ] Implicit Places using invariants in 146 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 15 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 183 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 215 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 834 ms.
Product exploration explored 100000 steps with 50000 reset in 511 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 105 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 1880 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 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:20] [INFO ] Invariant cache hit.
[2023-03-16 22:19:20] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-16 22:19:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:20] [INFO ] Invariant cache hit.
[2023-03-16 22:19:20] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:20] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-16 22:19:20] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:20] [INFO ] Invariant cache hit.
[2023-03-16 22:19:20] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 304 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 10707 reset in 481 ms.
Stack based approach found an accepted trace after 276 steps with 25 reset with depth 11 and stack size 11 in 4 ms.
FORMULA Peterson-COL-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-02 finished in 1484 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 7 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:21] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:21] [INFO ] Invariant cache hit.
[2023-03-16 22:19:21] [INFO ] Implicit Places using invariants in 155 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 158 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 6 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 172 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 241 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 6149 reset in 503 ms.
Stack based approach found an accepted trace after 1538 steps with 97 reset with depth 24 and stack size 24 in 13 ms.
FORMULA Peterson-COL-3-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-03 finished in 965 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 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:22] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:22] [INFO ] Invariant cache hit.
[2023-03-16 22:19:22] [INFO ] Implicit Places using invariants in 198 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 200 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 210 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 480 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 477 ms.
Product exploration explored 100000 steps with 1 reset in 604 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 764 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 491 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 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 22:19:25] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 240 cols
[2023-03-16 22:19:26] [INFO ] Computed 11 place invariants in 6 ms
[2023-03-16 22:19:26] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-16 22:19:26] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 22:19:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-16 22:19:26] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 22:19:26] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:26] [INFO ] After 155ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 22:19:26] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 61 places in 73 ms of which 0 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2023-03-16 22:19:27] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1016 ms
[2023-03-16 22:19:27] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 1 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 0 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 0 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 0 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-03-16 22:19:28] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 970 ms
[2023-03-16 22:19:28] [INFO ] After 2280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-16 22:19:28] [INFO ] After 2824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 25 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 31 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 32 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 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 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 7 ms. (steps per millisecond=5 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 7 ms. (steps per millisecond=5 ) 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 957 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 472 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 438 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-16 22:19:31] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:31] [INFO ] Invariant cache hit.
[2023-03-16 22:19:31] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-16 22:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:19:31] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-16 22:19:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:19:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-16 22:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:19:32] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2023-03-16 22:19:32] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:32] [INFO ] [Nat]Added 57 Read/Feed constraints in 22 ms returned sat
[2023-03-16 22:19:32] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 38 ms.
[2023-03-16 22:19:33] [INFO ] Added : 133 causal constraints over 27 iterations in 1202 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 4 ms. Remains 240 /240 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:33] [INFO ] Invariant cache hit.
[2023-03-16 22:19:33] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-16 22:19:33] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:33] [INFO ] Invariant cache hit.
[2023-03-16 22:19:34] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:34] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2023-03-16 22:19:34] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:34] [INFO ] Invariant cache hit.
[2023-03-16 22:19:34] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 946 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 904 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 484 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 270 ms. (steps per millisecond=37 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 22:19:36] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:36] [INFO ] Invariant cache hit.
[2023-03-16 22:19:36] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-16 22:19:36] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 22:19:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-16 22:19:36] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 22:19:36] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:37] [INFO ] After 114ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 22:19:37] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 1 ms to minimize.
[2023-03-16 22:19:37] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2023-03-16 22:19:37] [INFO ] Deduced a trap composed of 31 places in 142 ms of which 0 ms to minimize.
[2023-03-16 22:19:37] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 0 ms to minimize.
[2023-03-16 22:19:37] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 0 ms to minimize.
[2023-03-16 22:19:38] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 1 ms to minimize.
[2023-03-16 22:19:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 990 ms
[2023-03-16 22:19:38] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 1 ms to minimize.
[2023-03-16 22:19:38] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-16 22:19:38] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2023-03-16 22:19:38] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 1 ms to minimize.
[2023-03-16 22:19:38] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 1 ms to minimize.
[2023-03-16 22:19:39] [INFO ] Deduced a trap composed of 14 places in 171 ms of which 1 ms to minimize.
[2023-03-16 22:19:39] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 0 ms to minimize.
[2023-03-16 22:19:39] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 1 ms to minimize.
[2023-03-16 22:19:39] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1309 ms
[2023-03-16 22:19:39] [INFO ] After 2524ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-16 22:19:39] [INFO ] After 3040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 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 28 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 28 ms. Remains : 120/240 places, 212/332 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Finished probabilistic random walk after 38 steps, run visited all 2 properties in 7 ms. (steps per millisecond=5 )
Probabilistic random walk after 38 steps, saw 33 distinct states, run finished after 7 ms. (steps per millisecond=5 ) 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 787 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 499 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 481 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-16 22:19:41] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:41] [INFO ] Invariant cache hit.
[2023-03-16 22:19:42] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-03-16 22:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 22:19:42] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2023-03-16 22:19:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 22:19:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-16 22:19:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 22:19:43] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-03-16 22:19:43] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:43] [INFO ] [Nat]Added 57 Read/Feed constraints in 20 ms returned sat
[2023-03-16 22:19:43] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 32 ms.
[2023-03-16 22:19:44] [INFO ] Added : 133 causal constraints over 27 iterations in 1136 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 533 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 6 reset in 597 ms.
Product exploration explored 100000 steps with 1 reset in 353 ms.
Applying partial POR strategy [false, false, false, true, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 435 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 1 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 1 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 67 ms. Remains 186 /240 variables (removed 54) and now considering 287/332 (removed 45) transitions.
[2023-03-16 22:19:46] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-16 22:19:46] [INFO ] Flow matrix only has 263 transitions (discarded 24 similar events)
// Phase 1: matrix 263 rows 186 cols
[2023-03-16 22:19:46] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-16 22:19:47] [INFO ] Dead Transitions using invariants and state equation in 336 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 443 ms. Remains : 186/240 places, 287/332 transitions.
Built C files in :
/tmp/ltsmin10835770944652652643
[2023-03-16 22:19:47] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10835770944652652643
Running compilation step : cd /tmp/ltsmin10835770944652652643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1232 ms.
Running link step : cd /tmp/ltsmin10835770944652652643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10835770944652652643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7043662048750676984.hoa' '--buchi-type=spotba'
LTSmin run took 194 ms.
FORMULA Peterson-COL-3-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-COL-3-LTLFireability-04 finished in 26076 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-16 22:19:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2023-03-16 22:19:48] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-16 22:19:48] [INFO ] Implicit Places using invariants in 136 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 149 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 6 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 161 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 121 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 42 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 299 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 6 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:48] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:48] [INFO ] Invariant cache hit.
[2023-03-16 22:19:49] [INFO ] Implicit Places using invariants in 190 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 204 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 217 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 184 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 433 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 5 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:49] [INFO ] Invariant cache hit.
[2023-03-16 22:19:49] [INFO ] Implicit Places using invariants in 131 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 6 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 161 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 221 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 408 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-16 22:19:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:49] [INFO ] Invariant cache hit.
[2023-03-16 22:19:49] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-16 22:19:49] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:49] [INFO ] Invariant cache hit.
[2023-03-16 22:19:50] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-16 22:19:50] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2023-03-16 22:19:50] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:50] [INFO ] Invariant cache hit.
[2023-03-16 22:19:50] [INFO ] Dead Transitions using invariants and state equation in 452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 244/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 213 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 650 ms.
Product exploration explored 100000 steps with 50000 reset in 692 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 127 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 2630 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 4 ms. Remains 244 /244 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-03-16 22:19:52] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
[2023-03-16 22:19:52] [INFO ] Invariant cache hit.
[2023-03-16 22:19:52] [INFO ] Implicit Places using invariants in 159 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 162 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 170 ms. Remains : 240/244 places, 332/332 transitions.
Stuttering acceptance computed with spot in 255 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 0 reset in 391 ms.
Stack based approach found an accepted trace after 284 steps with 0 reset with depth 285 and stack size 285 in 2 ms.
FORMULA Peterson-COL-3-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-14 finished in 848 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 36 ms. Remains 120 /244 variables (removed 124) and now considering 208/332 (removed 124) transitions.
[2023-03-16 22:19:53] [INFO ] Flow matrix only has 184 transitions (discarded 24 similar events)
// Phase 1: matrix 184 rows 120 cols
[2023-03-16 22:19:53] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-16 22:19:53] [INFO ] Implicit Places using invariants in 176 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 181 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 226 ms. Remains : 116/244 places, 208/332 transitions.
Stuttering acceptance computed with spot in 347 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 1266 reset in 334 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Peterson-COL-3-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-3-LTLFireability-15 finished in 946 ms.
All properties solved by simple procedures.
Total runtime 44928 ms.

BK_STOP 1679005195203

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r261-smll-167863536500564"
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 ;