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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 17:20:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 17:20:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 17:20:58] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-08 17:20:58] [INFO ] Transformed 195 places.
[2023-03-08 17:20:58] [INFO ] Transformed 152 transitions.
[2023-03-08 17:20:58] [INFO ] Found NUPN structural information;
[2023-03-08 17:20:58] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 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 31 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 17:20:58] [INFO ] Computed 59 place invariants in 21 ms
[2023-03-08 17:20:58] [INFO ] Implicit Places using invariants in 255 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 282 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 9 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 322 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 57 out of 193 places after structural reductions.
[2023-03-08 17:20:59] [INFO ] Flatten gal took : 47 ms
[2023-03-08 17:20:59] [INFO ] Flatten gal took : 19 ms
[2023-03-08 17:20:59] [INFO ] Input system was already deterministic with 137 transitions.
Incomplete random walk after 10000 steps, including 216 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 38) seen :18
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 17:20:59] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 17:21:00] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:00] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 17:21:00] [INFO ] After 382ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-08 17:21:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 17:21:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 55 ms returned sat
[2023-03-08 17:21:01] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-08 17:21:01] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 4 ms to minimize.
[2023-03-08 17:21:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 17:21:02] [INFO ] After 1370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 531 ms.
[2023-03-08 17:21:02] [INFO ] After 2263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 6 properties in 753 ms.
Support contains 26 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 40 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 40 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 599252 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599252 steps, saw 86263 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:21:07] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:21:07] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2023-03-08 17:21:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 17:21:07] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 17:21:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 17:21:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 65 ms returned sat
[2023-03-08 17:21:08] [INFO ] After 496ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-08 17:21:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 17:21:08] [INFO ] After 321ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-08 17:21:09] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2023-03-08 17:21:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 17:21:09] [INFO ] After 806ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 367 ms.
[2023-03-08 17:21:09] [INFO ] After 1912ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 7 properties in 543 ms.
Support contains 18 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 9 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 10 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 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 17:21:10] [INFO ] Invariant cache hit.
[2023-03-08 17:21:10] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 17:21:10] [INFO ] Invariant cache hit.
[2023-03-08 17:21:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 17:21:10] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 17:21:10] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 17:21:10] [INFO ] Invariant cache hit.
[2023-03-08 17:21:10] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 451 ms. Remains : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-08 17:21:10] [INFO ] Invariant cache hit.
[2023-03-08 17:21:10] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:10] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 17:21:10] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 17:21:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-08 17:21:11] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 17:21:11] [INFO ] After 538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-08 17:21:11] [INFO ] After 859ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
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 2 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 17:21:12] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 17:21:12] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 17:21:12] [INFO ] Invariant cache hit.
[2023-03-08 17:21:12] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-08 17:21:12] [INFO ] Invariant cache hit.
[2023-03-08 17:21:12] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 438 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 8 steps with 0 reset in 2 ms.
FORMULA DES-PT-20a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-00 finished in 909 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 23 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:12] [INFO ] Invariant cache hit.
[2023-03-08 17:21:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 17:21:13] [INFO ] Invariant cache hit.
[2023-03-08 17:21:13] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 17:21:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 17:21:13] [INFO ] Invariant cache hit.
[2023-03-08 17:21:13] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 114 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 44 steps with 0 reset in 2 ms.
FORMULA DES-PT-20a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-01 finished in 548 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 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:13] [INFO ] Invariant cache hit.
[2023-03-08 17:21:13] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 17:21:13] [INFO ] Invariant cache hit.
[2023-03-08 17:21:13] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-08 17:21:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 17:21:13] [INFO ] Invariant cache hit.
[2023-03-08 17:21:13] [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 385 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 48 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 2227 reset in 288 ms.
Product exploration explored 100000 steps with 2245 reset in 285 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 153 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 42 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1701535 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :{}
Probabilistic random walk after 1701535 steps, saw 232532 distinct states, run finished after 3001 ms. (steps per millisecond=566 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 17:21:17] [INFO ] Invariant cache hit.
[2023-03-08 17:21:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:21:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-08 17:21:18] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:18] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 17:21:18] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 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 14 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 10001 steps, including 64 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1738364 steps, run timeout after 3001 ms. (steps per millisecond=579 ) properties seen :{}
Probabilistic random walk after 1738364 steps, saw 242671 distinct states, run finished after 3001 ms. (steps per millisecond=579 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:21:21] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 17:21:21] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:21:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2023-03-08 17:21:21] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:21] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:21] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 17:21:21] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 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 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 17:21:21] [INFO ] Invariant cache hit.
[2023-03-08 17:21:21] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-08 17:21:21] [INFO ] Invariant cache hit.
[2023-03-08 17:21:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:21] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-08 17:21:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 17:21:21] [INFO ] Invariant cache hit.
[2023-03-08 17:21:21] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 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 10 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 17:21:21] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:21:22] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:21:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2023-03-08 17:21:22] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:22] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 17:21:22] [INFO ] After 263ms 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 146 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 45 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 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 13 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 17:21:22] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 17:21:22] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 17:21:22] [INFO ] Invariant cache hit.
[2023-03-08 17:21:22] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-08 17:21:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 17:21:22] [INFO ] Invariant cache hit.
[2023-03-08 17:21:22] [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 392 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 137 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 42 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1813089 steps, run timeout after 3001 ms. (steps per millisecond=604 ) properties seen :{}
Probabilistic random walk after 1813089 steps, saw 246026 distinct states, run finished after 3001 ms. (steps per millisecond=604 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 17:21:26] [INFO ] Invariant cache hit.
[2023-03-08 17:21:26] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:21:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2023-03-08 17:21:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-08 17:21:26] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:26] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 17:21:26] [INFO ] After 248ms 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, 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 16 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 16 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1717793 steps, run timeout after 3001 ms. (steps per millisecond=572 ) properties seen :{}
Probabilistic random walk after 1717793 steps, saw 240319 distinct states, run finished after 3001 ms. (steps per millisecond=572 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:21:29] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 17:21:29] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:21:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 62 ms returned sat
[2023-03-08 17:21:29] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:29] [INFO ] After 24ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:29] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 17:21:29] [INFO ] After 292ms 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, 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.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 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 17:21:29] [INFO ] Invariant cache hit.
[2023-03-08 17:21:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 17:21:29] [INFO ] Invariant cache hit.
[2023-03-08 17:21:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:30] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 17:21:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 17:21:30] [INFO ] Invariant cache hit.
[2023-03-08 17:21:30] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 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 17:21:30] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:21:30] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:21:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 71 ms returned sat
[2023-03-08 17:21:30] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:21:30] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 17:21:30] [INFO ] After 270ms 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 200 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 43 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2215 reset in 206 ms.
Product exploration explored 100000 steps with 2226 reset in 224 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 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 17:21:31] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 17:21:31] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 17:21:31] [INFO ] Invariant cache hit.
[2023-03-08 17:21:31] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 17:21:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:21:31] [INFO ] Invariant cache hit.
[2023-03-08 17:21:31] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 429 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-02 finished in 18379 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 17:21:31] [INFO ] Invariant cache hit.
[2023-03-08 17:21:32] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-08 17:21:32] [INFO ] Invariant cache hit.
[2023-03-08 17:21:32] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-08 17:21:32] [INFO ] Invariant cache hit.
[2023-03-08 17:21:32] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 100 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 98 steps with 8 reset in 2 ms.
FORMULA DES-PT-20a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-03 finished in 584 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 17:21:32] [INFO ] Invariant cache hit.
[2023-03-08 17:21:32] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 17:21:32] [INFO ] Invariant cache hit.
[2023-03-08 17:21:32] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-08 17:21:32] [INFO ] Invariant cache hit.
[2023-03-08 17:21:32] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 370 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 6 steps with 1 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-04 finished in 781 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:33] [INFO ] Invariant cache hit.
[2023-03-08 17:21:33] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 17:21:33] [INFO ] Invariant cache hit.
[2023-03-08 17:21:33] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-08 17:21:33] [INFO ] Invariant cache hit.
[2023-03-08 17:21:33] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 113 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 407 ms.
Product exploration explored 100000 steps with 50000 reset in 391 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 119 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 1423 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 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:34] [INFO ] Invariant cache hit.
[2023-03-08 17:21:34] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 17:21:34] [INFO ] Invariant cache hit.
[2023-03-08 17:21:34] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-08 17:21:34] [INFO ] Invariant cache hit.
[2023-03-08 17:21:35] [INFO ] Dead Transitions using invariants and state equation in 85 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 119 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 495 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 17:21:35] [INFO ] Invariant cache hit.
[2023-03-08 17:21:35] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 17:21:35] [INFO ] Invariant cache hit.
[2023-03-08 17:21:35] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 17:21:35] [INFO ] Invariant cache hit.
[2023-03-08 17:21:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 299 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 2239 reset in 272 ms.
Product exploration explored 100000 steps with 2231 reset in 278 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 128 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 153 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 213 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 67 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 64 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 17:21:36] [INFO ] Invariant cache hit.
[2023-03-08 17:21:36] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:36] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 17:21:36] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:21:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 17:21:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 17:21:37] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:37] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 17:21:37] [INFO ] After 311ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 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 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 143 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1224417 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :{}
Probabilistic random walk after 1224417 steps, saw 171374 distinct states, run finished after 3002 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:21:40] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:21:40] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 17:21:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 17:21:40] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:21:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 50 ms returned sat
[2023-03-08 17:21:40] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:40] [INFO ] After 45ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2023-03-08 17:21:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 17:21:40] [INFO ] After 143ms 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 17:21:40] [INFO ] After 458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 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 5 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 5 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 17:21:40] [INFO ] Invariant cache hit.
[2023-03-08 17:21:41] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 17:21:41] [INFO ] Invariant cache hit.
[2023-03-08 17:21:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:41] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-08 17:21:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 17:21:41] [INFO ] Invariant cache hit.
[2023-03-08 17:21:41] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 420 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 17:21:41] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 17:21:41] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 17:21:41] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:21:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 17:21:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2023-03-08 17:21:41] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:41] [INFO ] After 199ms 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 17:21:41] [INFO ] After 345ms 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 169 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 167 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 17:21:42] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 17:21:42] [INFO ] [Real]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-08 17:21:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 17:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 17:21:42] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-08 17:21:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 17:21:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 17:21:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-08 17:21:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 17:21:43] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-03-08 17:21:43] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-08 17:21:43] [INFO ] Added : 66 causal constraints over 14 iterations in 263 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 17:21:43] [INFO ] Invariant cache hit.
[2023-03-08 17:21:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 17:21:43] [INFO ] Invariant cache hit.
[2023-03-08 17:21:43] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-08 17:21:43] [INFO ] Invariant cache hit.
[2023-03-08 17:21:43] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 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 135 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 165 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 17:21:44] [INFO ] Invariant cache hit.
[2023-03-08 17:21:44] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:44] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 17:21:44] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:21:44] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:44] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 17:21:44] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:44] [INFO ] After 178ms 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 17:21:44] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 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 9 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 9 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 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 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1213735 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :{}
Probabilistic random walk after 1213735 steps, saw 170026 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:21:47] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 17:21:47] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 17:21:47] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:21:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 49 ms returned sat
[2023-03-08 17:21:48] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:48] [INFO ] After 44ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:48] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-08 17:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 17:21:48] [INFO ] After 137ms 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 17:21:48] [INFO ] After 441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 32 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 17:21:48] [INFO ] Invariant cache hit.
[2023-03-08 17:21:48] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 17:21:48] [INFO ] Invariant cache hit.
[2023-03-08 17:21:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:21:48] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-08 17:21:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:21:48] [INFO ] Invariant cache hit.
[2023-03-08 17:21:48] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 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 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:21:48] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 17:21:48] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 17:21:48] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 17:21:48] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 17:21:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:48] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 49 ms returned sat
[2023-03-08 17:21:49] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 17:21:49] [INFO ] After 202ms 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 17:21:49] [INFO ] After 347ms 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 163 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 157 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 17:21:49] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 17:21:49] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 17:21:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 17:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 17:21:50] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-03-08 17:21:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 17:21:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 17:21:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 17:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 17:21:50] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-08 17:21:50] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 17:21:50] [INFO ] Added : 66 causal constraints over 14 iterations in 237 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Product exploration explored 100000 steps with 2238 reset in 210 ms.
Product exploration explored 100000 steps with 2224 reset in 231 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 169 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 16 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 17:21:51] [INFO ] Invariant cache hit.
[2023-03-08 17:21:51] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 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 17:21:51] [INFO ] Invariant cache hit.
[2023-03-08 17:21:51] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 17:21:51] [INFO ] Invariant cache hit.
[2023-03-08 17:21:51] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-08 17:21:51] [INFO ] Invariant cache hit.
[2023-03-08 17:21:52] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-07 finished in 16931 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:52] [INFO ] Invariant cache hit.
[2023-03-08 17:21:52] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 17:21:52] [INFO ] Invariant cache hit.
[2023-03-08 17:21:52] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 17:21:52] [INFO ] Invariant cache hit.
[2023-03-08 17:21:52] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 155 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 368 ms.
Product exploration explored 100000 steps with 50000 reset in 380 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 130 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 1466 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 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:53] [INFO ] Invariant cache hit.
[2023-03-08 17:21:53] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 17:21:53] [INFO ] Invariant cache hit.
[2023-03-08 17:21:53] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-08 17:21:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:21:53] [INFO ] Invariant cache hit.
[2023-03-08 17:21:53] [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 365 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 224 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 34 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 607 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 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:54] [INFO ] Invariant cache hit.
[2023-03-08 17:21:54] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 17:21:54] [INFO ] Invariant cache hit.
[2023-03-08 17:21:54] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-08 17:21:54] [INFO ] Invariant cache hit.
[2023-03-08 17:21:54] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 379 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 204 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 295 ms.
Product exploration explored 100000 steps with 33333 reset in 311 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 57 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 1265 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 17:21:55] [INFO ] Invariant cache hit.
[2023-03-08 17:21:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 17:21:55] [INFO ] Invariant cache hit.
[2023-03-08 17:21:55] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 17:21:55] [INFO ] Invariant cache hit.
[2023-03-08 17:21:55] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 254 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 34 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-11 finished in 643 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:56] [INFO ] Invariant cache hit.
[2023-03-08 17:21:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 17:21:56] [INFO ] Invariant cache hit.
[2023-03-08 17:21:56] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-08 17:21:56] [INFO ] Invariant cache hit.
[2023-03-08 17:21:56] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 350 ms. Remains : 193/193 places, 137/137 transitions.
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)))]
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 4349 reset in 210 ms.
Product exploration explored 100000 steps with 4267 reset in 233 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 673 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 117 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 223 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 17:21:58] [INFO ] Invariant cache hit.
[2023-03-08 17:21:58] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:21:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:21:58] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 17:21:58] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:21:58] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-08 17:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 17:21:58] [INFO ] After 293ms 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 17:21:58] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 708 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=354 )
Parikh walk visited 3 properties in 12 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 615 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 122 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 129 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 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:21:59] [INFO ] Invariant cache hit.
[2023-03-08 17:21:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 17:21:59] [INFO ] Invariant cache hit.
[2023-03-08 17:21:59] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-08 17:21:59] [INFO ] Invariant cache hit.
[2023-03-08 17:21:59] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 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 523 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 115 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 229 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 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 62 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 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 17:22:00] [INFO ] Invariant cache hit.
[2023-03-08 17:22:00] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:22:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:00] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 17:22:00] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:22:01] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-08 17:22:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 17:22:01] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-08 17:22:01] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 739 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=246 )
Parikh walk visited 3 properties in 11 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 608 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 117 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 116 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 128 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 4338 reset in 212 ms.
Product exploration explored 100000 steps with 4288 reset in 233 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:22:02] [INFO ] Invariant cache hit.
[2023-03-08 17:22:02] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 17:22:02] [INFO ] Invariant cache hit.
[2023-03-08 17:22:03] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-08 17:22:03] [INFO ] Invariant cache hit.
[2023-03-08 17:22:03] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-13 finished in 7034 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 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:22:03] [INFO ] Invariant cache hit.
[2023-03-08 17:22:03] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 17:22:03] [INFO ] Invariant cache hit.
[2023-03-08 17:22:03] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2023-03-08 17:22:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:22:03] [INFO ] Invariant cache hit.
[2023-03-08 17:22:03] [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 345 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 252 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 2218 reset in 234 ms.
Product exploration explored 100000 steps with 2213 reset in 257 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 1260 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 253 ms :[p2, true, (NOT p0), p2, p2, (AND (NOT p0) p2), p2]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 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 45 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 704231 steps, run timeout after 3001 ms. (steps per millisecond=234 ) properties seen :{}
Probabilistic random walk after 704231 steps, saw 108658 distinct states, run finished after 3001 ms. (steps per millisecond=234 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-08 17:22:09] [INFO ] Invariant cache hit.
[2023-03-08 17:22:09] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 17:22:09] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 17:22:09] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 17:22:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:09] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 43 ms returned sat
[2023-03-08 17:22:10] [INFO ] After 391ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-08 17:22:10] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2023-03-08 17:22:10] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-08 17:22:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2023-03-08 17:22:10] [INFO ] After 875ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 310 ms.
[2023-03-08 17:22:10] [INFO ] After 1383ms 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 164 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 7 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 7 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 844616 steps, run timeout after 3001 ms. (steps per millisecond=281 ) properties seen :{}
Probabilistic random walk after 844616 steps, saw 120349 distinct states, run finished after 3001 ms. (steps per millisecond=281 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 17:22:14] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 17:22:14] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:22:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:22:14] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 17:22:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 17:22:14] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 17:22:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:22:15] [INFO ] After 202ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 17:22:15] [INFO ] After 429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-08 17:22:15] [INFO ] After 1047ms 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 71 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 17:22:15] [INFO ] Invariant cache hit.
[2023-03-08 17:22:15] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 17:22:15] [INFO ] Invariant cache hit.
[2023-03-08 17:22:15] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 17:22:15] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2023-03-08 17:22:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 17:22:15] [INFO ] Invariant cache hit.
[2023-03-08 17:22:16] [INFO ] Dead Transitions using invariants and state equation in 83 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 6 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 17:22:16] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 17:22:16] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:22:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 17:22:16] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 17:22:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 17:22:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 17:22:16] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 17:22:16] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 17:22:16] [INFO ] After 495ms 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 1326 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 49 ms :[true, p2]
Stuttering acceptance computed with spot in 36 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 7 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 17:22:18] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 17:22:18] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 17:22:18] [INFO ] Invariant cache hit.
[2023-03-08 17:22:18] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-08 17:22:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 17:22:18] [INFO ] Invariant cache hit.
[2023-03-08 17:22:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 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 163 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, p2]
Incomplete random walk after 10000 steps, including 233 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 46 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1760093 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :{}
Probabilistic random walk after 1760093 steps, saw 238720 distinct states, run finished after 3001 ms. (steps per millisecond=586 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 17:22:21] [INFO ] Invariant cache hit.
[2023-03-08 17:22:21] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:21] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 17:22:21] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:22:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 17:22:21] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:22:21] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 17:22:21] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 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 10 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 140 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 24 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1723957 steps, run timeout after 3001 ms. (steps per millisecond=574 ) properties seen :{}
Probabilistic random walk after 1723957 steps, saw 241014 distinct states, run finished after 3002 ms. (steps per millisecond=574 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-08 17:22:25] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 17:22:25] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 17:22:25] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 17:22:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 44 ms returned sat
[2023-03-08 17:22:25] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 17:22:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 17:22:25] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 17:22:25] [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 9 ms.
[2023-03-08 17:22:25] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1397 steps, including 2 resets, run visited all 1 properties in 8 ms. (steps per millisecond=174 )
Parikh walk visited 1 properties in 8 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 172 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 22401 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 4 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 17:22:25] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 17:22:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-08 17:22:25] [INFO ] Invariant cache hit.
[2023-03-08 17:22:25] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-08 17:22:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 17:22:25] [INFO ] Invariant cache hit.
[2023-03-08 17:22:25] [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 385 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 31 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 45 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 433 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 131 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 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:22:26] [INFO ] Invariant cache hit.
[2023-03-08 17:22:26] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 17:22:26] [INFO ] Invariant cache hit.
[2023-03-08 17:22:26] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-08 17:22:26] [INFO ] Invariant cache hit.
[2023-03-08 17:22:26] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 353 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 4103 reset in 205 ms.
Product exploration explored 100000 steps with 4222 reset in 230 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 566 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 118 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 220 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 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 63 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 17:22:28] [INFO ] Invariant cache hit.
[2023-03-08 17:22:28] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:22:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:28] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-08 17:22:28] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:22:28] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-08 17:22:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-03-08 17:22:28] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-08 17:22:28] [INFO ] After 489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 806 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=161 )
Parikh walk visited 3 properties in 29 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 622 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 124 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 126 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 17:22:29] [INFO ] Invariant cache hit.
[2023-03-08 17:22:29] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 17:22:29] [INFO ] Invariant cache hit.
[2023-03-08 17:22:29] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-08 17:22:29] [INFO ] Invariant cache hit.
[2023-03-08 17:22:29] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 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 526 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 187 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 227 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 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 17:22:30] [INFO ] Invariant cache hit.
[2023-03-08 17:22:30] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 17:22:30] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 17:22:30] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 17:22:31] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 17:22:31] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-08 17:22:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 17:22:31] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-08 17:22:31] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 811 steps, including 2 resets, run visited all 1 properties in 5 ms. (steps per millisecond=162 )
Parikh walk visited 3 properties in 27 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 653 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 110 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 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 132 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 4242 reset in 213 ms.
Product exploration explored 100000 steps with 4229 reset in 231 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 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 17:22:32] [INFO ] Invariant cache hit.
[2023-03-08 17:22:33] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 17:22:33] [INFO ] Invariant cache hit.
[2023-03-08 17:22:33] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-08 17:22:33] [INFO ] Invariant cache hit.
[2023-03-08 17:22:33] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 193/193 places, 137/137 transitions.
Treatment of property DES-PT-20a-LTLFireability-13 finished in 7171 ms.
[2023-03-08 17:22:33] [INFO ] Flatten gal took : 15 ms
[2023-03-08 17:22:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 17:22:33] [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 95144 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2462/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2462/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2462/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-20a-LTLFireability-02
Could not compute solution for formula : DES-PT-20a-LTLFireability-07
Could not compute solution for formula : DES-PT-20a-LTLFireability-13

BK_STOP 1678296154680

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DES-PT-20a-LTLFireability-02
ltl formula formula --ltl=/tmp/2462/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 137 transitions and 671 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2462/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2462/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2462/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2462/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name DES-PT-20a-LTLFireability-07
ltl formula formula --ltl=/tmp/2462/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 137 transitions and 671 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2462/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2462/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2462/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2462/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name DES-PT-20a-LTLFireability-13
ltl formula formula --ltl=/tmp/2462/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 193 places, 137 transitions and 671 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2462/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2462/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2462/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2462/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r105-tall-167814481200428"
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 ;