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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:22 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 DES-PT-20a-LTLFireability-00
FORMULA_NAME DES-PT-20a-LTLFireability-01
FORMULA_NAME DES-PT-20a-LTLFireability-02
FORMULA_NAME DES-PT-20a-LTLFireability-03
FORMULA_NAME DES-PT-20a-LTLFireability-04
FORMULA_NAME DES-PT-20a-LTLFireability-05
FORMULA_NAME DES-PT-20a-LTLFireability-06
FORMULA_NAME DES-PT-20a-LTLFireability-07
FORMULA_NAME DES-PT-20a-LTLFireability-08
FORMULA_NAME DES-PT-20a-LTLFireability-09
FORMULA_NAME DES-PT-20a-LTLFireability-10
FORMULA_NAME DES-PT-20a-LTLFireability-11
FORMULA_NAME DES-PT-20a-LTLFireability-12
FORMULA_NAME DES-PT-20a-LTLFireability-13
FORMULA_NAME DES-PT-20a-LTLFireability-14
FORMULA_NAME DES-PT-20a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678251583930

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:59:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:59:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:59:45] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-08 04:59:45] [INFO ] Transformed 195 places.
[2023-03-08 04:59:45] [INFO ] Transformed 152 transitions.
[2023-03-08 04:59:45] [INFO ] Found NUPN structural information;
[2023-03-08 04:59:45] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 57 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 29 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2023-03-08 04:59:45] [INFO ] Computed 59 place invariants in 19 ms
[2023-03-08 04:59:46] [INFO ] Implicit Places using invariants in 436 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 499 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 57 out of 193 places after structural reductions.
[2023-03-08 04:59:46] [INFO ] Flatten gal took : 36 ms
[2023-03-08 04:59:46] [INFO ] Flatten gal took : 16 ms
[2023-03-08 04:59:46] [INFO ] Input system was already deterministic with 137 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 38) seen :19
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 04:59:46] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 04:59:46] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:59:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 04:59:47] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-08 04:59:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 64 ms returned sat
[2023-03-08 04:59:48] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-08 04:59:48] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
[2023-03-08 04:59:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 04:59:48] [INFO ] After 1615ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 556 ms.
[2023-03-08 04:59:49] [INFO ] After 2459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 2 properties in 657 ms.
Support contains 29 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 193 transition count 135
Applied a total of 4 rules in 30 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 127 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 670873 steps, run timeout after 3001 ms. (steps per millisecond=223 ) properties seen :{}
Probabilistic random walk after 670873 steps, saw 96482 distinct states, run finished after 3003 ms. (steps per millisecond=223 ) properties seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 04:59:53] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 04:59:53] [INFO ] [Real]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 04:59:53] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 04:59:53] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-08 04:59:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 04:59:53] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 64 ms returned sat
[2023-03-08 04:59:54] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-08 04:59:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:54] [INFO ] After 407ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-08 04:59:55] [INFO ] After 934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 442 ms.
[2023-03-08 04:59:55] [INFO ] After 2119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 4 properties in 477 ms.
Support contains 23 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 04:59:56] [INFO ] Invariant cache hit.
[2023-03-08 04:59:56] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 04:59:56] [INFO ] Invariant cache hit.
[2023-03-08 04:59:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:59:56] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-08 04:59:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:59:56] [INFO ] Invariant cache hit.
[2023-03-08 04:59:56] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 382 ms. Remains : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 13 properties.
[2023-03-08 04:59:56] [INFO ] Invariant cache hit.
[2023-03-08 04:59:56] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 04:59:56] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 04:59:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:59:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-08 04:59:57] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 04:59:57] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-08 04:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 04:59:57] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 277 ms.
[2023-03-08 04:59:57] [INFO ] After 1089ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
FORMULA DES-PT-20a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 91 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)||G(p1))) U (p2 U p3)))'
Support contains 9 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 04:59:58] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 04:59:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 04:59:58] [INFO ] Invariant cache hit.
[2023-03-08 04:59:58] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2023-03-08 04:59:58] [INFO ] Invariant cache hit.
[2023-03-08 04:59:58] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 430 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p0), (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : DES-PT-20a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(AND (EQ s20 1) (EQ s112 1) (EQ s114 1)), p2:(AND (EQ s22 1) (EQ s188 1)), p0:(AND (EQ s24 1) (EQ s188 1)), p1:(AND (EQ s13 1) (EQ s112 1) (EQ s114 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-00 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p1)&&p0) U p2))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:58] [INFO ] Invariant cache hit.
[2023-03-08 04:59:59] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 04:59:59] [INFO ] Invariant cache hit.
[2023-03-08 04:59:59] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-08 04:59:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:59:59] [INFO ] Invariant cache hit.
[2023-03-08 04:59:59] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-20a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s38 1) (EQ s188 1) (EQ s143 1) (EQ s159 1)), p0:(AND (EQ s38 1) (EQ s188 1)), p1:(AND (EQ s38 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 38 steps with 0 reset in 3 ms.
FORMULA DES-PT-20a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-01 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 04:59:59] [INFO ] Invariant cache hit.
[2023-03-08 04:59:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 04:59:59] [INFO ] Invariant cache hit.
[2023-03-08 04:59:59] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-08 04:59:59] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 04:59:59] [INFO ] Invariant cache hit.
[2023-03-08 04:59:59] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s67 0) (EQ s85 0) (EQ s89 0) (EQ s173 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2224 reset in 338 ms.
Product exploration explored 100000 steps with 2212 reset in 270 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1809889 steps, run timeout after 3001 ms. (steps per millisecond=603 ) properties seen :{}
Probabilistic random walk after 1809889 steps, saw 245522 distinct states, run finished after 3001 ms. (steps per millisecond=603 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:00:03] [INFO ] Invariant cache hit.
[2023-03-08 05:00:03] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:00:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:03] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 05:00:03] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:03] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 05:00:03] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 193 transition count 135
Applied a total of 5 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1727806 steps, run timeout after 3001 ms. (steps per millisecond=575 ) properties seen :{}
Probabilistic random walk after 1727806 steps, saw 241513 distinct states, run finished after 3002 ms. (steps per millisecond=575 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:07] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:00:07] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:00:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 05:00:07] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:07] [INFO ] After 21ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:07] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 05:00:07] [INFO ] After 255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 05:00:07] [INFO ] Invariant cache hit.
[2023-03-08 05:00:07] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 05:00:07] [INFO ] Invariant cache hit.
[2023-03-08 05:00:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:07] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-08 05:00:07] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 05:00:07] [INFO ] Invariant cache hit.
[2023-03-08 05:00:07] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:07] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:00:07] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:00:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-08 05:00:08] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:08] [INFO ] After 117ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 05:00:08] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 05:00:08] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:00:08] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 05:00:08] [INFO ] Invariant cache hit.
[2023-03-08 05:00:08] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-08 05:00:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:08] [INFO ] Invariant cache hit.
[2023-03-08 05:00:08] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 384 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1763869 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :{}
Probabilistic random walk after 1763869 steps, saw 239346 distinct states, run finished after 3001 ms. (steps per millisecond=587 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:00:12] [INFO ] Invariant cache hit.
[2023-03-08 05:00:12] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:00:12] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:12] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 05:00:12] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:12] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:00:12] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 193 transition count 135
Applied a total of 5 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1803931 steps, run timeout after 3001 ms. (steps per millisecond=601 ) properties seen :{}
Probabilistic random walk after 1803931 steps, saw 251818 distinct states, run finished after 3001 ms. (steps per millisecond=601 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:15] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:00:15] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:00:15] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-08 05:00:15] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 05:00:15] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:15] [INFO ] After 22ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:15] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:00:15] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 05:00:15] [INFO ] Invariant cache hit.
[2023-03-08 05:00:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 05:00:15] [INFO ] Invariant cache hit.
[2023-03-08 05:00:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:15] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 05:00:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:15] [INFO ] Invariant cache hit.
[2023-03-08 05:00:15] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:16] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 05:00:16] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:00:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2023-03-08 05:00:16] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:00:16] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:00:16] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2203 reset in 192 ms.
Product exploration explored 100000 steps with 2230 reset in 198 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 05:00:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:00:17] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:17] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-08 05:00:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:17] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-02 finished in 17932 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||G(F(p1))))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:17] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:17] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s96 1) (EQ s110 1)), p1:(AND (EQ s4 1) (EQ s112 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 239 steps with 12 reset in 3 ms.
FORMULA DES-PT-20a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-03 finished in 470 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) U (!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:17] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 05:00:17] [INFO ] Invariant cache hit.
[2023-03-08 05:00:18] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 05:00:18] [INFO ] Invariant cache hit.
[2023-03-08 05:00:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 322 ms :[p1, (NOT p0), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND (NOT p0) p1), true, p2, (AND p0 p1), (AND p2 p1 p0), (AND p2 (NOT p0))]
Running random walk in product with property : DES-PT-20a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 p1 p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}]], initial=0, aps=[p2:(AND (EQ s28 1) (EQ s188 1)), p1:(OR (EQ s0 1) (AND (EQ s28 1) (EQ s188 1))), p0:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 2 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-04 finished in 734 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:18] [INFO ] Invariant cache hit.
[2023-03-08 05:00:18] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 05:00:18] [INFO ] Invariant cache hit.
[2023-03-08 05:00:18] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-08 05:00:18] [INFO ] Invariant cache hit.
[2023-03-08 05:00:18] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s29 1) (EQ s188 1)) (EQ s119 0) (EQ s136 0)), p0:(OR (EQ s62 0) (EQ s85 0))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Product exploration explored 100000 steps with 50000 reset in 378 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-05 finished in 1456 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 U p1))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:20] [INFO ] Invariant cache hit.
[2023-03-08 05:00:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 05:00:20] [INFO ] Invariant cache hit.
[2023-03-08 05:00:20] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-08 05:00:20] [INFO ] Invariant cache hit.
[2023-03-08 05:00:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s86 1), p0:(AND (EQ s6 1) (EQ s112 1) (EQ s114 1) (OR (EQ s14 1) (AND (EQ s86 1) (EQ s107 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-06 finished in 454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:20] [INFO ] Invariant cache hit.
[2023-03-08 05:00:20] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 05:00:20] [INFO ] Invariant cache hit.
[2023-03-08 05:00:20] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-08 05:00:20] [INFO ] Invariant cache hit.
[2023-03-08 05:00:20] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DES-PT-20a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s182 1) (EQ s187 1)), p0:(AND (EQ s65 1) (EQ s85 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 2240 reset in 253 ms.
Product exploration explored 100000 steps with 2211 reset in 264 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:00:21] [INFO ] Invariant cache hit.
[2023-03-08 05:00:21] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:21] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 05:00:21] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:00:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:00:22] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:22] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-08 05:00:22] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 144 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1264244 steps, run timeout after 3001 ms. (steps per millisecond=421 ) properties seen :{}
Probabilistic random walk after 1264244 steps, saw 176553 distinct states, run finished after 3001 ms. (steps per millisecond=421 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:25] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 05:00:25] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 7 ms returned sat
[2023-03-08 05:00:25] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:00:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2023-03-08 05:00:25] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:25] [INFO ] After 42ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:25] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-08 05:00:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-08 05:00:25] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-08 05:00:25] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 05:00:25] [INFO ] Invariant cache hit.
[2023-03-08 05:00:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 05:00:26] [INFO ] Invariant cache hit.
[2023-03-08 05:00:26] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:26] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 05:00:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:00:26] [INFO ] Invariant cache hit.
[2023-03-08 05:00:26] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 397 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:26] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 05:00:26] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 05:00:26] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:00:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-08 05:00:26] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:26] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-08 05:00:26] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 05:00:27] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:00:27] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 05:00:27] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:00:27] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2023-03-08 05:00:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:00:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 05:00:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 05:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:00:27] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-08 05:00:27] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-08 05:00:28] [INFO ] Added : 66 causal constraints over 14 iterations in 230 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:28] [INFO ] Invariant cache hit.
[2023-03-08 05:00:28] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 05:00:28] [INFO ] Invariant cache hit.
[2023-03-08 05:00:28] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-08 05:00:28] [INFO ] Invariant cache hit.
[2023-03-08 05:00:28] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:00:28] [INFO ] Invariant cache hit.
[2023-03-08 05:00:28] [INFO ] [Real]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:00:28] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 05:00:28] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:00:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:28] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:00:29] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:29] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-08 05:00:29] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 133 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 76 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1284806 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :{}
Probabilistic random walk after 1284806 steps, saw 178927 distinct states, run finished after 3001 ms. (steps per millisecond=428 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:32] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:00:32] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:00:32] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:00:32] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:00:32] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:32] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-08 05:00:32] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:32] [INFO ] After 45ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:32] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2023-03-08 05:00:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 05:00:32] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 05:00:32] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 05:00:32] [INFO ] Invariant cache hit.
[2023-03-08 05:00:32] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 05:00:32] [INFO ] Invariant cache hit.
[2023-03-08 05:00:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:33] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-08 05:00:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:00:33] [INFO ] Invariant cache hit.
[2023-03-08 05:00:33] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 384 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:33] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 05:00:33] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 05:00:33] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:00:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 45 ms returned sat
[2023-03-08 05:00:33] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:00:33] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-08 05:00:33] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 05:00:34] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:00:34] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:00:34] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:00:34] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2023-03-08 05:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:00:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:00:34] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 05:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:00:34] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-08 05:00:34] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-08 05:00:34] [INFO ] Added : 66 causal constraints over 14 iterations in 231 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Product exploration explored 100000 steps with 2226 reset in 192 ms.
Product exploration explored 100000 steps with 2240 reset in 210 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 15 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:35] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:35] [INFO ] Invariant cache hit.
[2023-03-08 05:00:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 193/193 places, 137/137 transitions.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:35] [INFO ] Invariant cache hit.
[2023-03-08 05:00:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:00:36] [INFO ] Invariant cache hit.
[2023-03-08 05:00:36] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-08 05:00:36] [INFO ] Invariant cache hit.
[2023-03-08 05:00:36] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-07 finished in 15835 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(p1)||F(p2)||p0)))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:36] [INFO ] Invariant cache hit.
[2023-03-08 05:00:36] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-08 05:00:36] [INFO ] Invariant cache hit.
[2023-03-08 05:00:36] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-08 05:00:36] [INFO ] Invariant cache hit.
[2023-03-08 05:00:36] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 453 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (EQ s86 1) (EQ s107 1)), p1:(AND (EQ s89 1) (EQ s173 1)), p0:(OR (EQ s9 0) (EQ s112 0) (EQ s114 0))], 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]]
Product exploration explored 100000 steps with 50000 reset in 346 ms.
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 7 factoid took 119 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-08 finished in 1424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1)) U (!p2 U G(p0))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:37] [INFO ] Invariant cache hit.
[2023-03-08 05:00:37] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 05:00:37] [INFO ] Invariant cache hit.
[2023-03-08 05:00:38] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-08 05:00:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:38] [INFO ] Invariant cache hit.
[2023-03-08 05:00:38] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s95 1) (EQ s105 1)), p1:(AND (EQ s171 1) (EQ s176 1)), p2:(AND (EQ s116 1) (EQ s118 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-09 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(F(p1))))||p0))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:38] [INFO ] Invariant cache hit.
[2023-03-08 05:00:38] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 05:00:38] [INFO ] Invariant cache hit.
[2023-03-08 05:00:38] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-08 05:00:38] [INFO ] Invariant cache hit.
[2023-03-08 05:00:38] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s62 0) (EQ s85 0)), p1:(OR (EQ s46 0) (EQ s109 0) (EQ s15 0) (EQ s112 0) (EQ s114 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 282 ms.
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-10 finished in 1187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((((F(p1)&&p0) U p1)&&F(p2)))))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:39] [INFO ] Invariant cache hit.
[2023-03-08 05:00:39] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-08 05:00:39] [INFO ] Invariant cache hit.
[2023-03-08 05:00:39] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 05:00:39] [INFO ] Invariant cache hit.
[2023-03-08 05:00:39] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-20a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(AND (EQ s73 1) (EQ s85 1)), p1:(AND (EQ s101 1) (EQ s106 1) (EQ s108 1)), p0:(AND (EQ s75 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 85 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-11 finished in 539 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)&&(p1||X(p2)))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:40] [INFO ] Invariant cache hit.
[2023-03-08 05:00:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 05:00:40] [INFO ] Invariant cache hit.
[2023-03-08 05:00:40] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-08 05:00:40] [INFO ] Invariant cache hit.
[2023-03-08 05:00:40] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-20a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s112 0) (EQ s114 0)), p1:(AND (EQ s76 1) (EQ s85 1)), p2:(OR (EQ s175 0) (EQ s189 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4324 reset in 198 ms.
Product exploration explored 100000 steps with 4158 reset in 220 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 493 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:00:41] [INFO ] Invariant cache hit.
[2023-03-08 05:00:41] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:00:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-08 05:00:42] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:00:42] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2023-03-08 05:00:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2023-03-08 05:00:42] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-08 05:00:42] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 729 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=243 )
Parikh walk visited 3 properties in 13 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 623 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:43] [INFO ] Invariant cache hit.
[2023-03-08 05:00:43] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 05:00:43] [INFO ] Invariant cache hit.
[2023-03-08 05:00:43] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-08 05:00:43] [INFO ] Invariant cache hit.
[2023-03-08 05:00:43] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 625 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:00:44] [INFO ] Invariant cache hit.
[2023-03-08 05:00:44] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:00:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-08 05:00:44] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:00:44] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2023-03-08 05:00:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 05:00:44] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-08 05:00:44] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 837 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=279 )
Parikh walk visited 3 properties in 17 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 607 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 4173 reset in 201 ms.
Product exploration explored 100000 steps with 4249 reset in 215 ms.
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:46] [INFO ] Invariant cache hit.
[2023-03-08 05:00:46] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 05:00:46] [INFO ] Invariant cache hit.
[2023-03-08 05:00:46] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 05:00:46] [INFO ] Invariant cache hit.
[2023-03-08 05:00:46] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-13 finished in 6641 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(((G(p0)||p1) U !(G(F(X(p2)))||(p0 U p2)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:00:46] [INFO ] Invariant cache hit.
[2023-03-08 05:00:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 05:00:46] [INFO ] Invariant cache hit.
[2023-03-08 05:00:46] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-08 05:00:46] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:46] [INFO ] Invariant cache hit.
[2023-03-08 05:00:47] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 214 ms :[p2, true, (NOT p0), p2, p2, (AND (NOT p0) p2), p2]
Running random walk in product with property : DES-PT-20a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s188 1)), p2:(AND (EQ s2 1) (EQ s112 1) (EQ s114 1)), p1:(AND (EQ s33 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2224 reset in 226 ms.
Product exploration explored 100000 steps with 2242 reset in 241 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (OR p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1142 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter insensitive) to 7 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 384 ms :[p2, true, (NOT p0), p2, p2, (AND (NOT p0) p2), p2]
Incomplete random walk after 10000 steps, including 233 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 847909 steps, run timeout after 3001 ms. (steps per millisecond=282 ) properties seen :{}
Probabilistic random walk after 847909 steps, saw 125889 distinct states, run finished after 3001 ms. (steps per millisecond=282 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-08 05:00:52] [INFO ] Invariant cache hit.
[2023-03-08 05:00:52] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 05:00:52] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 05:00:52] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 05:00:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:53] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-08 05:00:53] [INFO ] After 357ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-08 05:00:53] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-08 05:00:53] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2023-03-08 05:00:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2023-03-08 05:00:53] [INFO ] After 801ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 286 ms.
[2023-03-08 05:00:54] [INFO ] After 1283ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 17 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 944649 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 944649 steps, saw 134322 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:57] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 05:00:57] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:00:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 05:00:57] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 05:00:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 05:00:58] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 05:00:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:58] [INFO ] After 180ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 05:00:58] [INFO ] After 373ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-08 05:00:58] [INFO ] After 925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 46 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 05:00:58] [INFO ] Invariant cache hit.
[2023-03-08 05:00:58] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 05:00:58] [INFO ] Invariant cache hit.
[2023-03-08 05:00:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:00:59] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-08 05:00:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:00:59] [INFO ] Invariant cache hit.
[2023-03-08 05:00:59] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 05:00:59] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 05:00:59] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 05:00:59] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:00:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:00:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 05:00:59] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 05:00:59] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-08 05:00:59] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (OR p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (OR (AND p2 p1) (AND p2 p0)))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 28 factoid took 1177 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, p2]
Stuttering acceptance computed with spot in 38 ms :[true, p2]
Support contains 3 out of 193 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 05:01:01] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 05:01:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-08 05:01:01] [INFO ] Invariant cache hit.
[2023-03-08 05:01:01] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 05:01:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:01:01] [INFO ] Invariant cache hit.
[2023-03-08 05:01:01] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 344 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[true, p2]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1895427 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 1895427 steps, saw 257357 distinct states, run finished after 3002 ms. (steps per millisecond=631 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:01:04] [INFO ] Invariant cache hit.
[2023-03-08 05:01:04] [INFO ] [Real]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:01:04] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:01:04] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:01:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:01:04] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:01:04] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:01:04] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 05:01:04] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 192 transition count 134
Applied a total of 9 rules in 9 ms. Remains 192 /193 variables (removed 1) and now considering 134/137 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/193 places, 134/137 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1845487 steps, run timeout after 3001 ms. (steps per millisecond=614 ) properties seen :{}
Probabilistic random walk after 1845487 steps, saw 257417 distinct states, run finished after 3003 ms. (steps per millisecond=614 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-08 05:01:07] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:01:07] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:01:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 05:01:08] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:01:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:01:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 41 ms returned sat
[2023-03-08 05:01:08] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:01:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:01:08] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:01:08] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-08 05:01:08] [INFO ] After 223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1120 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=280 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Property proved to be false thanks to negative knowledge :(F p2)
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-14 finished in 21625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 05:01:08] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:01:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 05:01:08] [INFO ] Invariant cache hit.
[2023-03-08 05:01:08] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 05:01:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:01:08] [INFO ] Invariant cache hit.
[2023-03-08 05:01:08] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-15 finished in 388 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
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)&&(p1||X(p2)))))'
Found a Shortening insensitive property : DES-PT-20a-LTLFireability-13
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:01:09] [INFO ] Invariant cache hit.
[2023-03-08 05:01:09] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 05:01:09] [INFO ] Invariant cache hit.
[2023-03-08 05:01:09] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-08 05:01:09] [INFO ] Invariant cache hit.
[2023-03-08 05:01:09] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 341 ms. Remains : 193/193 places, 137/137 transitions.
Running random walk in product with property : DES-PT-20a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s112 0) (EQ s114 0)), p1:(AND (EQ s76 1) (EQ s85 1)), p2:(OR (EQ s175 0) (EQ s189 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4300 reset in 197 ms.
Product exploration explored 100000 steps with 4234 reset in 218 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 573 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 214 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:01:10] [INFO ] Invariant cache hit.
[2023-03-08 05:01:10] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:01:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:01:10] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-08 05:01:11] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:01:11] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2023-03-08 05:01:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-08 05:01:11] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-08 05:01:11] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 763 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=152 )
Parikh walk visited 3 properties in 17 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 634 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:01:12] [INFO ] Invariant cache hit.
[2023-03-08 05:01:12] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 05:01:12] [INFO ] Invariant cache hit.
[2023-03-08 05:01:12] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 05:01:12] [INFO ] Invariant cache hit.
[2023-03-08 05:01:12] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 475 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 05:01:13] [INFO ] Invariant cache hit.
[2023-03-08 05:01:13] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:01:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:01:13] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 05:01:13] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:01:13] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-08 05:01:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 05:01:13] [INFO ] After 267ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-08 05:01:13] [INFO ] After 454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 803 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=267 )
Parikh walk visited 3 properties in 16 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 660 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 4149 reset in 201 ms.
Product exploration explored 100000 steps with 4262 reset in 220 ms.
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 05:01:15] [INFO ] Invariant cache hit.
[2023-03-08 05:01:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 05:01:15] [INFO ] Invariant cache hit.
[2023-03-08 05:01:15] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-08 05:01:15] [INFO ] Invariant cache hit.
[2023-03-08 05:01:15] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-13 finished in 6721 ms.
[2023-03-08 05:01:15] [INFO ] Flatten gal took : 15 ms
[2023-03-08 05:01:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 05:01:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 137 transitions and 671 arcs took 2 ms.
Total runtime 90338 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-20a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DES-PT-20a-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251746762

--------------------
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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 12 (type EXCL) for 0 DES-PT-20a-LTLFireability-02
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 DES-PT-20a-LTLFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 DES-PT-20a-LTLFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type SRCH) for 0 DES-PT-20a-LTLFireability-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 13 (type SRCH) for DES-PT-20a-LTLFireability-02
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/374/LTLFireability-11.sara.
lola: FINISHED task # 12 (type EXCL) for DES-PT-20a-LTLFireability-02
lola: result : true
lola: markings : 9166
lola: fired transitions : 11447
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 10 (type FNDP) for DES-PT-20a-LTLFireability-02 (obsolete)
lola: CANCELED task # 11 (type EQUN) for DES-PT-20a-LTLFireability-02 (obsolete)
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-20a-LTLFireability-13
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EQUN) for DES-PT-20a-LTLFireability-02
lola: result : unknown
lola: FINISHED task # 10 (type FNDP) for DES-PT-20a-LTLFireability-02
lola: result : unknown
lola: fired transitions : 20440
lola: tried executions : 231
lola: time used : 0.000000
lola: memory pages used : 0
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1800 5/32 DES-PT-20a-LTLFireability-13 632554 m, 126510 m/sec, 4263913 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1800 10/32 DES-PT-20a-LTLFireability-13 1218086 m, 117106 m/sec, 8591089 t fired, .

Time elapsed: 10 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1800 14/32 DES-PT-20a-LTLFireability-13 1812671 m, 118917 m/sec, 12824926 t fired, .

Time elapsed: 15 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1800 19/32 DES-PT-20a-LTLFireability-13 2438544 m, 125174 m/sec, 17132428 t fired, .

Time elapsed: 20 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1800 23/32 DES-PT-20a-LTLFireability-13 3016214 m, 115534 m/sec, 21420741 t fired, .

Time elapsed: 25 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1800 28/32 DES-PT-20a-LTLFireability-13 3648769 m, 126511 m/sec, 25692899 t fired, .

Time elapsed: 30 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1800 32/32 DES-PT-20a-LTLFireability-13 4229221 m, 116090 m/sec, 29959492 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for DES-PT-20a-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-20a-LTLFireability-07
lola: time limit : 3560 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3560 7/32 DES-PT-20a-LTLFireability-07 862939 m, 172587 m/sec, 4499217 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3560 13/32 DES-PT-20a-LTLFireability-07 1648443 m, 157100 m/sec, 8924320 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3560 18/32 DES-PT-20a-LTLFireability-07 2382423 m, 146796 m/sec, 13336454 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3560 24/32 DES-PT-20a-LTLFireability-07 3093778 m, 142271 m/sec, 17738142 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3560 29/32 DES-PT-20a-LTLFireability-07 3773510 m, 135946 m/sec, 22039369 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for DES-PT-20a-LTLFireability-07 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-20a-LTLFireability-07: LTL 0 0 0 0 1 0 1 0
DES-PT-20a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-20a-LTLFireability-02: AG false state space
DES-PT-20a-LTLFireability-07: LTL unknown AGGR
DES-PT-20a-LTLFireability-13: LTL unknown AGGR


Time elapsed: 70 secs. Pages in use: 32

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="DES-PT-20a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-20a, 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 r103-tall-167814478300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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