Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 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 97K 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-50a-LTLFireability-00
FORMULA_NAME DES-PT-50a-LTLFireability-01
FORMULA_NAME DES-PT-50a-LTLFireability-02
FORMULA_NAME DES-PT-50a-LTLFireability-03
FORMULA_NAME DES-PT-50a-LTLFireability-04
FORMULA_NAME DES-PT-50a-LTLFireability-05
FORMULA_NAME DES-PT-50a-LTLFireability-06
FORMULA_NAME DES-PT-50a-LTLFireability-07
FORMULA_NAME DES-PT-50a-LTLFireability-08
FORMULA_NAME DES-PT-50a-LTLFireability-09
FORMULA_NAME DES-PT-50a-LTLFireability-10
FORMULA_NAME DES-PT-50a-LTLFireability-11
FORMULA_NAME DES-PT-50a-LTLFireability-12
FORMULA_NAME DES-PT-50a-LTLFireability-13
FORMULA_NAME DES-PT-50a-LTLFireability-14
FORMULA_NAME DES-PT-50a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678254193920

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:43:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:43:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:43:15] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-08 05:43:15] [INFO ] Transformed 314 places.
[2023-03-08 05:43:15] [INFO ] Transformed 271 transitions.
[2023-03-08 05:43:15] [INFO ] Found NUPN structural information;
[2023-03-08 05:43:15] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 117 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 38 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-08 05:43:15] [INFO ] Computed 59 place invariants in 34 ms
[2023-03-08 05:43:16] [INFO ] Implicit Places using invariants in 558 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 313/314 places, 257/257 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 634 ms. Remains : 313/314 places, 257/257 transitions.
Support contains 40 out of 313 places after structural reductions.
[2023-03-08 05:43:16] [INFO ] Flatten gal took : 54 ms
[2023-03-08 05:43:16] [INFO ] Flatten gal took : 30 ms
[2023-03-08 05:43:16] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 417 ms. (steps per millisecond=23 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 05:43:17] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:43:17] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2023-03-08 05:43:17] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 05:43:17] [INFO ] After 276ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-08 05:43:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:43:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 151 ms returned sat
[2023-03-08 05:43:27] [INFO ] After 9271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-08 05:43:30] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 4 ms to minimize.
[2023-03-08 05:43:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-08 05:43:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3258 ms
[2023-03-08 05:43:40] [INFO ] After 22355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1600 ms.
[2023-03-08 05:43:42] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 7 properties in 912 ms.
Support contains 12 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 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 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 312 transition count 254
Applied a total of 8 rules in 45 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 714776 steps, run timeout after 3001 ms. (steps per millisecond=238 ) properties seen :{}
Probabilistic random walk after 714776 steps, saw 102753 distinct states, run finished after 3003 ms. (steps per millisecond=238 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:43:46] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:43:47] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:43:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 05:43:47] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 05:43:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:43:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2023-03-08 05:43:48] [INFO ] After 690ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 05:43:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:43:48] [INFO ] After 371ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 05:43:48] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-08 05:43:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 05:43:49] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-08 05:43:49] [INFO ] After 2483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 1 properties in 491 ms.
Support contains 12 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:43:50] [INFO ] Invariant cache hit.
[2023-03-08 05:43:50] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 05:43:50] [INFO ] Invariant cache hit.
[2023-03-08 05:43:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:43:50] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2023-03-08 05:43:50] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 05:43:50] [INFO ] Invariant cache hit.
[2023-03-08 05:43:50] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 7 properties.
[2023-03-08 05:43:50] [INFO ] Invariant cache hit.
[2023-03-08 05:43:50] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:43:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-08 05:43:50] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 05:43:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:43:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 87 ms returned sat
[2023-03-08 05:43:51] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 05:43:52] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 262 ms.
[2023-03-08 05:43:52] [INFO ] After 1345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Computed a total of 216 stabilizing places and 211 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((F(p0)&&G(p1))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:43:52] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 05:43:52] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-08 05:43:52] [INFO ] Invariant cache hit.
[2023-03-08 05:43:53] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-08 05:43:53] [INFO ] Invariant cache hit.
[2023-03-08 05:43:53] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s182 0) (EQ s204 0)), p0:(OR (AND (EQ s301 1) (EQ s306 1)) (AND (EQ s142 1) (EQ s228 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 2211 reset in 459 ms.
Product exploration explored 100000 steps with 2218 reset in 295 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 303 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:43:54] [INFO ] Invariant cache hit.
[2023-03-08 05:43:54] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:43:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:43:54] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 05:43:55] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:43:55] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 05:43:55] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 22 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1623004 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :{}
Probabilistic random walk after 1623004 steps, saw 227747 distinct states, run finished after 3001 ms. (steps per millisecond=540 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:43:58] [INFO ] Computed 60 place invariants in 11 ms
[2023-03-08 05:43:58] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:43:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:43:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 95 ms returned sat
[2023-03-08 05:43:58] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:43:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:43:58] [INFO ] After 65ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:43:58] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:43:58] [INFO ] After 604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:43:58] [INFO ] Invariant cache hit.
[2023-03-08 05:43:58] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 05:43:58] [INFO ] Invariant cache hit.
[2023-03-08 05:43:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:43:59] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2023-03-08 05:43:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 05:43:59] [INFO ] Invariant cache hit.
[2023-03-08 05:43:59] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 692 ms. Remains : 312/312 places, 254/254 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 312 transition count 254
Applied a total of 1 rules in 16 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:43:59] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 05:43:59] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:43:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:43:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 91 ms returned sat
[2023-03-08 05:44:00] [INFO ] After 270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:00] [INFO ] After 322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 05:44:00] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:44:00] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:44:00] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:44:01] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 21 ms returned sat
[2023-03-08 05:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:44:02] [INFO ] [Real]Absence check using state equation in 1264 ms returned sat
[2023-03-08 05:44:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:44:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-08 05:44:02] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 136 ms returned sat
[2023-03-08 05:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:44:03] [INFO ] [Nat]Absence check using state equation in 653 ms returned sat
[2023-03-08 05:44:03] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 05:44:04] [INFO ] Added : 120 causal constraints over 24 iterations in 835 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:44:04] [INFO ] Invariant cache hit.
[2023-03-08 05:44:04] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 05:44:04] [INFO ] Invariant cache hit.
[2023-03-08 05:44:04] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-08 05:44:04] [INFO ] Invariant cache hit.
[2023-03-08 05:44:04] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 256 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:44:05] [INFO ] Invariant cache hit.
[2023-03-08 05:44:05] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:05] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 05:44:05] [INFO ] After 230ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:05] [INFO ] After 268ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 05:44:05] [INFO ] After 394ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 19 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 134 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 72 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1455518 steps, run timeout after 3001 ms. (steps per millisecond=485 ) properties seen :{}
Probabilistic random walk after 1455518 steps, saw 203203 distinct states, run finished after 3001 ms. (steps per millisecond=485 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:44:08] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 05:44:08] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:44:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 112 ms returned sat
[2023-03-08 05:44:09] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:44:09] [INFO ] After 67ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:09] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 05:44:09] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 21 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:44:09] [INFO ] Invariant cache hit.
[2023-03-08 05:44:09] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-08 05:44:09] [INFO ] Invariant cache hit.
[2023-03-08 05:44:10] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:44:10] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
[2023-03-08 05:44:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:44:10] [INFO ] Invariant cache hit.
[2023-03-08 05:44:10] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1174 ms. Remains : 312/312 places, 254/254 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 312 transition count 254
Applied a total of 1 rules in 22 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:44:10] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:44:10] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:10] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:44:10] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 96 ms returned sat
[2023-03-08 05:44:11] [INFO ] After 285ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:11] [INFO ] After 334ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:44:11] [INFO ] After 548ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X p1), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 300 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:44:11] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:44:12] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:44:12] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 05:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:44:13] [INFO ] [Real]Absence check using state equation in 1272 ms returned sat
[2023-03-08 05:44:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:44:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:44:13] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 138 ms returned sat
[2023-03-08 05:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:44:14] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-08 05:44:14] [INFO ] Computed and/alt/rep : 248/744/248 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-08 05:44:15] [INFO ] Added : 120 causal constraints over 24 iterations in 804 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 2255 reset in 222 ms.
Product exploration explored 100000 steps with 2193 reset in 234 ms.
Applying partial POR strategy [true, true, false, true]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 52 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:44:16] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:44:16] [INFO ] Invariant cache hit.
[2023-03-08 05:44:16] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 6 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:44:16] [INFO ] Invariant cache hit.
[2023-03-08 05:44:16] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 05:44:16] [INFO ] Invariant cache hit.
[2023-03-08 05:44:16] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-08 05:44:16] [INFO ] Invariant cache hit.
[2023-03-08 05:44:16] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 621 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-00 finished in 24363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 19 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:44:16] [INFO ] Invariant cache hit.
[2023-03-08 05:44:17] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 05:44:17] [INFO ] Invariant cache hit.
[2023-03-08 05:44:17] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2023-03-08 05:44:17] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 05:44:17] [INFO ] Invariant cache hit.
[2023-03-08 05:44:17] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 614 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-50a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s154 1) (NEQ s204 1)), p0:(OR (NEQ s114 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2223 reset in 253 ms.
Product exploration explored 100000 steps with 2203 reset in 219 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1130078 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{}
Probabilistic random walk after 1130078 steps, saw 161152 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:44:21] [INFO ] Invariant cache hit.
[2023-03-08 05:44:21] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:21] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 05:44:21] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:44:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:21] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 05:44:21] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:22] [INFO ] After 338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-08 05:44:22] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 55 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1113415 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :{}
Probabilistic random walk after 1113415 steps, saw 155790 distinct states, run finished after 3002 ms. (steps per millisecond=370 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:44:25] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 05:44:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 05:44:25] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:44:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 67 ms returned sat
[2023-03-08 05:44:25] [INFO ] After 354ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:44:26] [INFO ] After 112ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:26] [INFO ] After 201ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 05:44:26] [INFO ] After 798ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 109 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:44:26] [INFO ] Invariant cache hit.
[2023-03-08 05:44:26] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 05:44:26] [INFO ] Invariant cache hit.
[2023-03-08 05:44:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:44:26] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2023-03-08 05:44:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:44:26] [INFO ] Invariant cache hit.
[2023-03-08 05:44:26] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 680 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 05:44:26] [INFO ] Invariant cache hit.
[2023-03-08 05:44:27] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:44:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 05:44:27] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:44:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 100 ms returned sat
[2023-03-08 05:44:27] [INFO ] After 260ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:27] [INFO ] After 369ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 05:44:27] [INFO ] After 625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 20 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:44:28] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:44:28] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 05:44:28] [INFO ] Invariant cache hit.
[2023-03-08 05:44:28] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-08 05:44:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:44:28] [INFO ] Invariant cache hit.
[2023-03-08 05:44:28] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 215 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 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 53 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1133969 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1133969 steps, saw 161685 distinct states, run finished after 3001 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:44:32] [INFO ] Invariant cache hit.
[2023-03-08 05:44:32] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:32] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 05:44:32] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:44:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 05:44:32] [INFO ] After 256ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:32] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-08 05:44:32] [INFO ] After 543ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 87 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 12 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 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 21 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1133418 steps, run timeout after 3001 ms. (steps per millisecond=377 ) properties seen :{}
Probabilistic random walk after 1133418 steps, saw 158699 distinct states, run finished after 3003 ms. (steps per millisecond=377 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:44:35] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:44:36] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 05:44:36] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:44:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 71 ms returned sat
[2023-03-08 05:44:36] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:44:36] [INFO ] After 111ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:36] [INFO ] After 193ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 05:44:36] [INFO ] After 782ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 88 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:44:36] [INFO ] Invariant cache hit.
[2023-03-08 05:44:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 05:44:37] [INFO ] Invariant cache hit.
[2023-03-08 05:44:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:44:37] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-08 05:44:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:44:37] [INFO ] Invariant cache hit.
[2023-03-08 05:44:37] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 05:44:37] [INFO ] Invariant cache hit.
[2023-03-08 05:44:37] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:44:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 05:44:37] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:44:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:44:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 99 ms returned sat
[2023-03-08 05:44:38] [INFO ] After 263ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:44:38] [INFO ] After 378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 05:44:38] [INFO ] After 642ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2215 reset in 211 ms.
Product exploration explored 100000 steps with 2258 reset in 223 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 15 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:44:39] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:44:39] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 05:44:39] [INFO ] Invariant cache hit.
[2023-03-08 05:44:39] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
[2023-03-08 05:44:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:44:39] [INFO ] Invariant cache hit.
[2023-03-08 05:44:39] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-01 finished in 23077 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||X(G(p0)))))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 6 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:44:39] [INFO ] Invariant cache hit.
[2023-03-08 05:44:40] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 05:44:40] [INFO ] Invariant cache hit.
[2023-03-08 05:44:40] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 05:44:40] [INFO ] Invariant cache hit.
[2023-03-08 05:44:40] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 598 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s127 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-02 finished in 741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(F(p1))))))'
Support contains 5 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:44:40] [INFO ] Invariant cache hit.
[2023-03-08 05:44:40] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 05:44:40] [INFO ] Invariant cache hit.
[2023-03-08 05:44:41] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-08 05:44:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:44:41] [INFO ] Invariant cache hit.
[2023-03-08 05:44:41] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 617 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 808 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-50a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s81 1) (EQ s307 1)), p1:(AND (EQ s28 1) (EQ s231 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-05 finished in 1445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(!p1) U p2)))'
Support contains 7 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 17 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:44:42] [INFO ] Invariant cache hit.
[2023-03-08 05:44:42] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 05:44:42] [INFO ] Invariant cache hit.
[2023-03-08 05:44:42] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-08 05:44:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:44:42] [INFO ] Invariant cache hit.
[2023-03-08 05:44:42] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 594 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), p1, (NOT p2)]
Running random walk in product with property : DES-PT-50a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s69 1) (EQ s307 1)), p1:(OR (AND (EQ s13 1) (EQ s231 1) (EQ s233 1)) (AND (EQ s110 1) (EQ s228 1))), p0:(AND (EQ s110 1) (EQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 79 steps with 1 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-07 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 05:44:42] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 05:44:43] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-08 05:44:43] [INFO ] Invariant cache hit.
[2023-03-08 05:44:43] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2023-03-08 05:44:43] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:44:43] [INFO ] Invariant cache hit.
[2023-03-08 05:44:44] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1264 ms. Remains : 313/313 places, 257/257 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s236 1) (EQ s305 1))) (NOT (AND (EQ s73 1) (EQ s308 1)))), p0:(AND (EQ s189 1) (EQ s204 1)), p1:(AND (EQ s73 1) (EQ s308 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2223 reset in 217 ms.
Product exploration explored 100000 steps with 2219 reset in 228 ms.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 211 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:44:44] [INFO ] Invariant cache hit.
[2023-03-08 05:44:45] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:44:45] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 05:44:50] [INFO ] After 5253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:50] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2023-03-08 05:44:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-08 05:44:50] [INFO ] After 5486ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-08 05:44:50] [INFO ] After 5807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 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 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 135 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 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1514921 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :{}
Probabilistic random walk after 1514921 steps, saw 211832 distinct states, run finished after 3002 ms. (steps per millisecond=504 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:44:53] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:44:53] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:44:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-08 05:44:54] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:44:54] [INFO ] After 49ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:54] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 05:44:54] [INFO ] After 681ms 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 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:44:54] [INFO ] Invariant cache hit.
[2023-03-08 05:44:54] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:44:54] [INFO ] Invariant cache hit.
[2023-03-08 05:44:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:44:55] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
[2023-03-08 05:44:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:44:55] [INFO ] Invariant cache hit.
[2023-03-08 05:44:55] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 626 ms. Remains : 312/312 places, 254/254 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 312 transition count 254
Applied a total of 1 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:44:55] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:44:55] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:44:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 05:44:55] [INFO ] After 259ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:44:55] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 05:44:55] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 1610 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 8 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 05:44:57] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:44:57] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-08 05:44:57] [INFO ] Invariant cache hit.
[2023-03-08 05:44:58] [INFO ] Implicit Places using invariants and state equation in 860 ms returned []
Implicit Place search using SMT with State Equation took 1104 ms to find 0 implicit places.
[2023-03-08 05:44:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:44:58] [INFO ] Invariant cache hit.
[2023-03-08 05:44:58] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1290 ms. Remains : 313/313 places, 257/257 transitions.
Computed a total of 216 stabilizing places and 211 stable transitions
Computed a total of 216 stabilizing places and 211 stable transitions
Detected a total of 216/313 stabilizing places and 211/257 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 180 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:44:59] [INFO ] Invariant cache hit.
[2023-03-08 05:44:59] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:44:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:44:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 88 ms returned sat
[2023-03-08 05:45:04] [INFO ] After 5331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:05] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2023-03-08 05:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-08 05:45:05] [INFO ] After 5549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-08 05:45:05] [INFO ] After 5852ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 257/257 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 313 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 312 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 312 transition count 254
Applied a total of 9 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 254/257 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 312/313 places, 254/257 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1498656 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1498656 steps, saw 209085 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:45:08] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:45:08] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:08] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:08] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2023-03-08 05:45:08] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:45:08] [INFO ] After 56ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:08] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-08 05:45:09] [INFO ] After 700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:45:09] [INFO ] Invariant cache hit.
[2023-03-08 05:45:09] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 05:45:09] [INFO ] Invariant cache hit.
[2023-03-08 05:45:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:45:09] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
[2023-03-08 05:45:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:09] [INFO ] Invariant cache hit.
[2023-03-08 05:45:09] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 618 ms. Remains : 312/312 places, 254/254 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 312 transition count 254
Applied a total of 1 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:45:09] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:45:09] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 52 ms returned sat
[2023-03-08 05:45:10] [INFO ] After 262ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:10] [INFO ] After 309ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 05:45:10] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Product exploration explored 100000 steps with 2236 reset in 217 ms.
Product exploration explored 100000 steps with 2224 reset in 238 ms.
Support contains 6 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 313 cols
[2023-03-08 05:45:11] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:45:11] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-08 05:45:11] [INFO ] Invariant cache hit.
[2023-03-08 05:45:12] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2023-03-08 05:45:12] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:45:12] [INFO ] Invariant cache hit.
[2023-03-08 05:45:12] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1272 ms. Remains : 313/313 places, 257/257 transitions.
Treatment of property DES-PT-50a-LTLFireability-08 finished in 29600 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 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 12 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:45:12] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:45:12] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-08 05:45:12] [INFO ] Invariant cache hit.
[2023-03-08 05:45:12] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-08 05:45:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:12] [INFO ] Invariant cache hit.
[2023-03-08 05:45:13] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 605 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s144 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2216 reset in 201 ms.
Product exploration explored 100000 steps with 2241 reset in 225 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 216 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 50 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1541013 steps, run timeout after 3001 ms. (steps per millisecond=513 ) properties seen :{}
Probabilistic random walk after 1541013 steps, saw 214117 distinct states, run finished after 3004 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:45:16] [INFO ] Invariant cache hit.
[2023-03-08 05:45:16] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:16] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 05:45:17] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 05:45:17] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:17] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:45:17] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1548530 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :{}
Probabilistic random walk after 1548530 steps, saw 216845 distinct states, run finished after 3004 ms. (steps per millisecond=515 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:45:20] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 05:45:20] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2023-03-08 05:45:20] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-08 05:45:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-08 05:45:20] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:20] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:21] [INFO ] After 76ms 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 05:45:21] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:45:21] [INFO ] Invariant cache hit.
[2023-03-08 05:45:21] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 05:45:21] [INFO ] Invariant cache hit.
[2023-03-08 05:45:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:21] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-08 05:45:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:45:21] [INFO ] Invariant cache hit.
[2023-03-08 05:45:21] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 717 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:45:21] [INFO ] Invariant cache hit.
[2023-03-08 05:45:21] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:21] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 05:45:21] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 102 ms returned sat
[2023-03-08 05:45:22] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:22] [INFO ] After 189ms 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 05:45:22] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:45:22] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:45:22] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-08 05:45:22] [INFO ] Invariant cache hit.
[2023-03-08 05:45:22] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-08 05:45:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:22] [INFO ] Invariant cache hit.
[2023-03-08 05:45:23] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 597 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 204 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 219 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 51 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1555097 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :{}
Probabilistic random walk after 1555097 steps, saw 215765 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:45:26] [INFO ] Invariant cache hit.
[2023-03-08 05:45:26] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 05:45:26] [INFO ] After 221ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 05:45:26] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:26] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 05:45:26] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 20 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1500065 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1500065 steps, saw 209347 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:45:29] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:45:29] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:45:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:45:30] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:45:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 05:45:30] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:30] [INFO ] After 36ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:30] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 05:45:30] [INFO ] After 573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:45:30] [INFO ] Invariant cache hit.
[2023-03-08 05:45:30] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 05:45:30] [INFO ] Invariant cache hit.
[2023-03-08 05:45:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:31] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-08 05:45:31] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:31] [INFO ] Invariant cache hit.
[2023-03-08 05:45:31] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:45:31] [INFO ] Invariant cache hit.
[2023-03-08 05:45:31] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:45:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:45:31] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 05:45:31] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:31] [INFO ] After 197ms 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 05:45:31] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2251 reset in 199 ms.
Product exploration explored 100000 steps with 2213 reset in 214 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:45:32] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 05:45:32] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 05:45:32] [INFO ] Invariant cache hit.
[2023-03-08 05:45:32] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-08 05:45:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:32] [INFO ] Invariant cache hit.
[2023-03-08 05:45:33] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-09 finished in 20643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:45:33] [INFO ] Invariant cache hit.
[2023-03-08 05:45:33] [INFO ] Implicit Places using invariants in 289 ms returned []
[2023-03-08 05:45:33] [INFO ] Invariant cache hit.
[2023-03-08 05:45:33] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-08 05:45:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:33] [INFO ] Invariant cache hit.
[2023-03-08 05:45:33] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 758 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s215 1) (AND (EQ s81 1) (EQ s307 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 172 steps with 11 reset in 1 ms.
FORMULA DES-PT-50a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLFireability-10 finished in 814 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)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:45:34] [INFO ] Invariant cache hit.
[2023-03-08 05:45:34] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 05:45:34] [INFO ] Invariant cache hit.
[2023-03-08 05:45:34] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-08 05:45:34] [INFO ] Invariant cache hit.
[2023-03-08 05:45:34] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s307 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 502 ms.
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-11 finished in 1888 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 8 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:45:35] [INFO ] Invariant cache hit.
[2023-03-08 05:45:35] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 05:45:35] [INFO ] Invariant cache hit.
[2023-03-08 05:45:36] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 05:45:36] [INFO ] Invariant cache hit.
[2023-03-08 05:45:36] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s121 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2222 reset in 196 ms.
Product exploration explored 100000 steps with 2241 reset in 213 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 235 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1555970 steps, run timeout after 3001 ms. (steps per millisecond=518 ) properties seen :{}
Probabilistic random walk after 1555970 steps, saw 215868 distinct states, run finished after 3001 ms. (steps per millisecond=518 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:45:40] [INFO ] Invariant cache hit.
[2023-03-08 05:45:40] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:45:40] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 05:45:40] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 05:45:40] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:40] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-08 05:45:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 05:45:40] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:45:40] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 134 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 18 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1518223 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :{}
Probabilistic random walk after 1518223 steps, saw 212303 distinct states, run finished after 3002 ms. (steps per millisecond=505 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:45:43] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:45:43] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:45:44] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 75 ms returned sat
[2023-03-08 05:45:44] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:44] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:44] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-08 05:45:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-03-08 05:45:44] [INFO ] After 154ms 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 05:45:44] [INFO ] After 637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:45:44] [INFO ] Invariant cache hit.
[2023-03-08 05:45:44] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:45:44] [INFO ] Invariant cache hit.
[2023-03-08 05:45:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:45] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2023-03-08 05:45:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:45:45] [INFO ] Invariant cache hit.
[2023-03-08 05:45:45] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 747 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:45:45] [INFO ] Invariant cache hit.
[2023-03-08 05:45:45] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:45] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:45:45] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:45] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:45] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 95 ms returned sat
[2023-03-08 05:45:45] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:45] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 05:45:45] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 2 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:45:46] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:45:46] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:45:46] [INFO ] Invariant cache hit.
[2023-03-08 05:45:46] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-08 05:45:46] [INFO ] Invariant cache hit.
[2023-03-08 05:45:46] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1559668 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1559668 steps, saw 216268 distinct states, run finished after 3001 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:45:50] [INFO ] Invariant cache hit.
[2023-03-08 05:45:50] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:45:50] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 05:45:50] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:50] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-08 05:45:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 05:45:50] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 05:45:50] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 24 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 127 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 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1474301 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :{}
Probabilistic random walk after 1474301 steps, saw 205749 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:45:53] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 05:45:53] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:45:53] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:45:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-08 05:45:54] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:54] [INFO ] After 43ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:54] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-08 05:45:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 05:45:54] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 05:45:54] [INFO ] After 651ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:45:54] [INFO ] Invariant cache hit.
[2023-03-08 05:45:54] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 05:45:54] [INFO ] Invariant cache hit.
[2023-03-08 05:45:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:45:55] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2023-03-08 05:45:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:55] [INFO ] Invariant cache hit.
[2023-03-08 05:45:55] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 709 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:45:55] [INFO ] Invariant cache hit.
[2023-03-08 05:45:55] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:45:55] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2023-03-08 05:45:55] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:45:55] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 05:45:55] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2236 reset in 208 ms.
Product exploration explored 100000 steps with 2218 reset in 228 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:45:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:45:56] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:45:56] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 2 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:45:56] [INFO ] Invariant cache hit.
[2023-03-08 05:45:56] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-08 05:45:56] [INFO ] Invariant cache hit.
[2023-03-08 05:45:57] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2023-03-08 05:45:57] [INFO ] Invariant cache hit.
[2023-03-08 05:45:57] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-12 finished in 21552 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((X(G(p0))&&(!p1 U (p2||G(!p1))))))'
Support contains 13 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 11 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:45:57] [INFO ] Invariant cache hit.
[2023-03-08 05:45:57] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 05:45:57] [INFO ] Invariant cache hit.
[2023-03-08 05:45:57] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2023-03-08 05:45:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:45:57] [INFO ] Invariant cache hit.
[2023-03-08 05:45:57] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 610 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Running random walk in product with property : DES-PT-50a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s294 1) (EQ s308 1))) (NOT (AND (EQ s238 1) (EQ s255 1)))), p1:(AND (EQ s238 1) (EQ s255 1)), p0:(OR (EQ s234 0) (EQ s239 0) (EQ s24...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2228 reset in 278 ms.
Product exploration explored 100000 steps with 2252 reset in 292 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 590 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:45:59] [INFO ] Invariant cache hit.
[2023-03-08 05:45:59] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:45:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:45:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 86 ms returned sat
[2023-03-08 05:45:59] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (OR p2 (NOT p1))), (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0))))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR p2 (NOT p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (G (NOT (AND p1 (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (OR (AND (NOT p1) (NOT p0)) (AND p2 (NOT p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 16 factoid took 745 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Support contains 13 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:46:00] [INFO ] Invariant cache hit.
[2023-03-08 05:46:00] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 05:46:00] [INFO ] Invariant cache hit.
[2023-03-08 05:46:01] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-08 05:46:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:46:01] [INFO ] Invariant cache hit.
[2023-03-08 05:46:01] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 629 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (OR (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 422 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Finished random walk after 3606 steps, including 80 resets, run visited all 5 properties in 16 ms. (steps per millisecond=225 )
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (OR (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 516 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 2212 reset in 222 ms.
Product exploration explored 100000 steps with 2242 reset in 235 ms.
Support contains 13 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:46:03] [INFO ] Invariant cache hit.
[2023-03-08 05:46:03] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:46:03] [INFO ] Invariant cache hit.
[2023-03-08 05:46:03] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 05:46:03] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:46:03] [INFO ] Invariant cache hit.
[2023-03-08 05:46:03] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-13 finished in 6396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 9 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 14 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:46:03] [INFO ] Invariant cache hit.
[2023-03-08 05:46:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 05:46:03] [INFO ] Invariant cache hit.
[2023-03-08 05:46:04] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-08 05:46:04] [INFO ] Invariant cache hit.
[2023-03-08 05:46:04] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 578 ms. Remains : 312/313 places, 256/257 transitions.
Stuttering acceptance computed with spot in 131 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : DES-PT-50a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s194 1) (EQ s204 1) (EQ s144 1) (EQ s228 1)), p1:(OR (AND (EQ s3 1) (EQ s231 1) (EQ s233 1)) (AND (EQ s73 1) (EQ s307 1)) (AND (EQ s144 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 378 ms.
Product exploration explored 100000 steps with 33333 reset in 396 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLFireability-14 finished in 1672 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(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' '!(G(F((G(p1)||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' '!(G(F((p0||(!p1 U (p2||G(!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)))'
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)))'
Found a Lengthening insensitive property : DES-PT-50a-LTLFireability-12
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 313/313 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 312 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 312 transition count 256
Applied a total of 2 rules in 19 ms. Remains 312 /313 variables (removed 1) and now considering 256/257 (removed 1) transitions.
[2023-03-08 05:46:05] [INFO ] Invariant cache hit.
[2023-03-08 05:46:06] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 05:46:06] [INFO ] Invariant cache hit.
[2023-03-08 05:46:06] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-08 05:46:06] [INFO ] Invariant cache hit.
[2023-03-08 05:46:06] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 312/313 places, 256/257 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 600 ms. Remains : 312/313 places, 256/257 transitions.
Running random walk in product with property : DES-PT-50a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s121 1) (NEQ s228 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2231 reset in 194 ms.
Product exploration explored 100000 steps with 2240 reset in 217 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1620245 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :{}
Probabilistic random walk after 1620245 steps, saw 223565 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:46:10] [INFO ] Invariant cache hit.
[2023-03-08 05:46:10] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:46:10] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 05:46:10] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:46:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:10] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-08 05:46:10] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:10] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 0 ms to minimize.
[2023-03-08 05:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-08 05:46:10] [INFO ] After 289ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:46:10] [INFO ] After 411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1585553 steps, run timeout after 3001 ms. (steps per millisecond=528 ) properties seen :{}
Probabilistic random walk after 1585553 steps, saw 221786 distinct states, run finished after 3001 ms. (steps per millisecond=528 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:46:13] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 05:46:14] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:46:14] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:46:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:46:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 05:46:14] [INFO ] After 320ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:14] [INFO ] After 40ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:14] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-08 05:46:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-03-08 05:46:14] [INFO ] After 151ms 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 05:46:14] [INFO ] After 644ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:46:14] [INFO ] Invariant cache hit.
[2023-03-08 05:46:14] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 05:46:14] [INFO ] Invariant cache hit.
[2023-03-08 05:46:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:15] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2023-03-08 05:46:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:46:15] [INFO ] Invariant cache hit.
[2023-03-08 05:46:15] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 760 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:46:15] [INFO ] Invariant cache hit.
[2023-03-08 05:46:15] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:46:15] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:46:15] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:15] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 05:46:15] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:15] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 05:46:15] [INFO ] After 377ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:46:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:46:16] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 05:46:16] [INFO ] Invariant cache hit.
[2023-03-08 05:46:16] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-08 05:46:16] [INFO ] Invariant cache hit.
[2023-03-08 05:46:16] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 591 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 224 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 50 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1633793 steps, run timeout after 3001 ms. (steps per millisecond=544 ) properties seen :{}
Probabilistic random walk after 1633793 steps, saw 225200 distinct states, run finished after 3001 ms. (steps per millisecond=544 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:46:20] [INFO ] Invariant cache hit.
[2023-03-08 05:46:20] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:20] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 05:46:20] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:46:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:20] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 36 ms returned sat
[2023-03-08 05:46:20] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:20] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2023-03-08 05:46:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 05:46:20] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 05:46:20] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 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 312 transition count 254
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 312 transition count 254
Applied a total of 7 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 133 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 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1592121 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1592121 steps, saw 222816 distinct states, run finished after 3002 ms. (steps per millisecond=530 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 05:46:23] [INFO ] Computed 60 place invariants in 12 ms
[2023-03-08 05:46:23] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 05:46:23] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:46:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 80 ms returned sat
[2023-03-08 05:46:24] [INFO ] After 326ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:24] [INFO ] After 41ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:24] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-08 05:46:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-08 05:46:24] [INFO ] After 156ms 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 05:46:24] [INFO ] After 654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 05:46:24] [INFO ] Invariant cache hit.
[2023-03-08 05:46:24] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 05:46:24] [INFO ] Invariant cache hit.
[2023-03-08 05:46:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:46:25] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2023-03-08 05:46:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:46:25] [INFO ] Invariant cache hit.
[2023-03-08 05:46:25] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 724 ms. Remains : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:46:25] [INFO ] Invariant cache hit.
[2023-03-08 05:46:25] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:25] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 05:46:25] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:46:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:46:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 98 ms returned sat
[2023-03-08 05:46:25] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:46:25] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 05:46:25] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 302 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2223 reset in 220 ms.
Product exploration explored 100000 steps with 2221 reset in 234 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:46:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 05:46:26] [INFO ] Computed 58 place invariants in 14 ms
[2023-03-08 05:46:27] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 05:46:27] [INFO ] Invariant cache hit.
[2023-03-08 05:46:27] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:46:27] [INFO ] Invariant cache hit.
[2023-03-08 05:46:27] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 05:46:27] [INFO ] Invariant cache hit.
[2023-03-08 05:46:27] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLFireability-12 finished in 21897 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((X(G(p0))&&(!p1 U (p2||G(!p1))))))'
[2023-03-08 05:46:27] [INFO ] Flatten gal took : 22 ms
[2023-03-08 05:46:27] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 05:46:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 313 places, 257 transitions and 1239 arcs took 3 ms.
Total runtime 192444 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-50a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
LTLFireability

FORMULA DES-PT-50a-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678254709293

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:550
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 20 (type EXCL) for 19 DES-PT-50a-LTLFireability-13
lola: time limit : 514 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 5/514 3/32 DES-PT-50a-LTLFireability-13 280743 m, 56148 m/sec, 2629978 t fired, .

Time elapsed: 6 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 10/514 4/32 DES-PT-50a-LTLFireability-13 509235 m, 45698 m/sec, 5274630 t fired, .

Time elapsed: 11 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 15/514 6/32 DES-PT-50a-LTLFireability-13 730066 m, 44166 m/sec, 8016711 t fired, .

Time elapsed: 16 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 20/514 7/32 DES-PT-50a-LTLFireability-13 960320 m, 46050 m/sec, 10864107 t fired, .

Time elapsed: 21 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 25/514 9/32 DES-PT-50a-LTLFireability-13 1192089 m, 46353 m/sec, 13506010 t fired, .

Time elapsed: 26 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 30/514 10/32 DES-PT-50a-LTLFireability-13 1414291 m, 44440 m/sec, 16155667 t fired, .

Time elapsed: 31 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 35/514 12/32 DES-PT-50a-LTLFireability-13 1618096 m, 40761 m/sec, 18803650 t fired, .

Time elapsed: 36 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 40/514 13/32 DES-PT-50a-LTLFireability-13 1844333 m, 45247 m/sec, 21484316 t fired, .

Time elapsed: 41 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 45/514 15/32 DES-PT-50a-LTLFireability-13 2064798 m, 44093 m/sec, 24160028 t fired, .

Time elapsed: 46 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 50/514 16/32 DES-PT-50a-LTLFireability-13 2269219 m, 40884 m/sec, 26888351 t fired, .

Time elapsed: 51 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 55/514 18/32 DES-PT-50a-LTLFireability-13 2444864 m, 35129 m/sec, 29544654 t fired, .

Time elapsed: 56 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 60/514 19/32 DES-PT-50a-LTLFireability-13 2643201 m, 39667 m/sec, 32289720 t fired, .

Time elapsed: 61 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 65/514 20/32 DES-PT-50a-LTLFireability-13 2858755 m, 43110 m/sec, 35080596 t fired, .

Time elapsed: 66 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 70/514 22/32 DES-PT-50a-LTLFireability-13 3070674 m, 42383 m/sec, 37820224 t fired, .

Time elapsed: 71 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 75/514 23/32 DES-PT-50a-LTLFireability-13 3283727 m, 42610 m/sec, 40581231 t fired, .

Time elapsed: 76 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 80/514 25/32 DES-PT-50a-LTLFireability-13 3476230 m, 38500 m/sec, 43203153 t fired, .

Time elapsed: 81 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 85/514 26/32 DES-PT-50a-LTLFireability-13 3650989 m, 34951 m/sec, 45832587 t fired, .

Time elapsed: 86 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 90/514 27/32 DES-PT-50a-LTLFireability-13 3807900 m, 31382 m/sec, 48465820 t fired, .

Time elapsed: 91 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 95/514 28/32 DES-PT-50a-LTLFireability-13 3978666 m, 34153 m/sec, 51110279 t fired, .

Time elapsed: 96 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 100/514 30/32 DES-PT-50a-LTLFireability-13 4178725 m, 40011 m/sec, 53733679 t fired, .

Time elapsed: 101 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 105/514 31/32 DES-PT-50a-LTLFireability-13 4371461 m, 38547 m/sec, 56361343 t fired, .

Time elapsed: 106 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
20 LTL EXCL 110/514 32/32 DES-PT-50a-LTLFireability-13 4548098 m, 35327 m/sec, 59031326 t fired, .

Time elapsed: 111 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 20 (type EXCL) for DES-PT-50a-LTLFireability-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 116 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 17 (type EXCL) for 16 DES-PT-50a-LTLFireability-12
lola: time limit : 580 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 5/580 4/32 DES-PT-50a-LTLFireability-12 405392 m, 81078 m/sec, 2848744 t fired, .

Time elapsed: 121 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 10/580 6/32 DES-PT-50a-LTLFireability-12 778621 m, 74645 m/sec, 5620430 t fired, .

Time elapsed: 126 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 15/580 9/32 DES-PT-50a-LTLFireability-12 1110113 m, 66298 m/sec, 8391081 t fired, .

Time elapsed: 131 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 20/580 12/32 DES-PT-50a-LTLFireability-12 1452974 m, 68572 m/sec, 11168107 t fired, .

Time elapsed: 136 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 25/580 14/32 DES-PT-50a-LTLFireability-12 1736689 m, 56743 m/sec, 13894982 t fired, .

Time elapsed: 141 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 30/580 16/32 DES-PT-50a-LTLFireability-12 2075147 m, 67691 m/sec, 16675418 t fired, .

Time elapsed: 146 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 35/580 19/32 DES-PT-50a-LTLFireability-12 2414457 m, 67862 m/sec, 19519895 t fired, .

Time elapsed: 151 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 40/580 21/32 DES-PT-50a-LTLFireability-12 2738659 m, 64840 m/sec, 22330766 t fired, .

Time elapsed: 156 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 45/580 24/32 DES-PT-50a-LTLFireability-12 3097137 m, 71695 m/sec, 25179869 t fired, .

Time elapsed: 161 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 50/580 27/32 DES-PT-50a-LTLFireability-12 3466567 m, 73886 m/sec, 28036505 t fired, .

Time elapsed: 166 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 55/580 29/32 DES-PT-50a-LTLFireability-12 3811637 m, 69014 m/sec, 30791693 t fired, .

Time elapsed: 171 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
17 LTL EXCL 60/580 32/32 DES-PT-50a-LTLFireability-12 4124212 m, 62515 m/sec, 33549538 t fired, .

Time elapsed: 176 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 17 (type EXCL) for DES-PT-50a-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 181 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 5 (type EXCL) for 0 DES-PT-50a-LTLFireability-00
lola: time limit : 683 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/683 4/32 DES-PT-50a-LTLFireability-00 413379 m, 82675 m/sec, 2897636 t fired, .

Time elapsed: 186 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/683 7/32 DES-PT-50a-LTLFireability-00 789228 m, 75169 m/sec, 5692190 t fired, .

Time elapsed: 191 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/683 9/32 DES-PT-50a-LTLFireability-00 1124486 m, 67051 m/sec, 8503399 t fired, .

Time elapsed: 196 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/683 12/32 DES-PT-50a-LTLFireability-00 1471489 m, 69400 m/sec, 11326357 t fired, .

Time elapsed: 201 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/683 14/32 DES-PT-50a-LTLFireability-00 1767131 m, 59128 m/sec, 14114982 t fired, .

Time elapsed: 206 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/683 16/32 DES-PT-50a-LTLFireability-00 2102676 m, 67109 m/sec, 16916471 t fired, .

Time elapsed: 211 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/683 19/32 DES-PT-50a-LTLFireability-00 2445032 m, 68471 m/sec, 19759052 t fired, .

Time elapsed: 216 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/683 22/32 DES-PT-50a-LTLFireability-00 2764151 m, 63823 m/sec, 22569735 t fired, .

Time elapsed: 221 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/683 24/32 DES-PT-50a-LTLFireability-00 3128530 m, 72875 m/sec, 25412130 t fired, .

Time elapsed: 226 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/683 27/32 DES-PT-50a-LTLFireability-00 3486610 m, 71616 m/sec, 28211065 t fired, .

Time elapsed: 231 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 55/683 30/32 DES-PT-50a-LTLFireability-00 3832040 m, 69086 m/sec, 30976802 t fired, .

Time elapsed: 236 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 60/683 32/32 DES-PT-50a-LTLFireability-00 4144233 m, 62438 m/sec, 33720596 t fired, .

Time elapsed: 241 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 5 (type EXCL) for DES-PT-50a-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 246 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 3 (type EXCL) for 0 DES-PT-50a-LTLFireability-00
lola: time limit : 838 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/838 5/32 DES-PT-50a-LTLFireability-00 538012 m, 107602 m/sec, 2861911 t fired, .

Time elapsed: 251 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/838 9/32 DES-PT-50a-LTLFireability-00 1074658 m, 107329 m/sec, 5709564 t fired, .

Time elapsed: 256 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/838 13/32 DES-PT-50a-LTLFireability-00 1575782 m, 100224 m/sec, 8602670 t fired, .

Time elapsed: 261 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/838 17/32 DES-PT-50a-LTLFireability-00 2035586 m, 91960 m/sec, 11412736 t fired, .

Time elapsed: 266 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/838 20/32 DES-PT-50a-LTLFireability-00 2470818 m, 87046 m/sec, 14197014 t fired, .

Time elapsed: 271 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 30/838 24/32 DES-PT-50a-LTLFireability-00 2965351 m, 98906 m/sec, 17047961 t fired, .

Time elapsed: 276 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 35/838 28/32 DES-PT-50a-LTLFireability-00 3450057 m, 96941 m/sec, 19945348 t fired, .

Time elapsed: 281 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 40/838 31/32 DES-PT-50a-LTLFireability-00 3906186 m, 91225 m/sec, 22893352 t fired, .

Time elapsed: 286 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 3 (type EXCL) for DES-PT-50a-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 291 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 14 (type EXCL) for 13 DES-PT-50a-LTLFireability-09
lola: time limit : 1103 sec
lola: memory limit: 32 pages
lola: FINISHED task # 14 (type EXCL) for DES-PT-50a-LTLFireability-09
lola: result : false
lola: markings : 677050
lola: fired transitions : 879667
lola: time used : 2.000000
lola: memory pages used : 6
lola: LAUNCH task # 8 (type EXCL) for 7 DES-PT-50a-LTLFireability-01
lola: time limit : 1653 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 3/1653 9/32 DES-PT-50a-LTLFireability-01 1020484 m, 204096 m/sec, 1362427 t fired, .

Time elapsed: 296 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 8/1653 22/32 DES-PT-50a-LTLFireability-01 2698770 m, 335657 m/sec, 3486586 t fired, .

Time elapsed: 301 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 8 (type EXCL) for DES-PT-50a-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 306 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: LAUNCH task # 11 (type EXCL) for 10 DES-PT-50a-LTLFireability-08
lola: time limit : 3294 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/3294 12/32 DES-PT-50a-LTLFireability-08 1610780 m, 322156 m/sec, 2293766 t fired, .

Time elapsed: 311 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/3294 24/32 DES-PT-50a-LTLFireability-08 3145974 m, 307038 m/sec, 4509954 t fired, .

Time elapsed: 316 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 6
lola: CANCELED task # 11 (type EXCL) for DES-PT-50a-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-50a-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
DES-PT-50a-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-12: LTL 0 0 0 0 1 0 1 0
DES-PT-50a-LTLFireability-13: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-50a-LTLFireability-00: CONJ unknown CONJ
DES-PT-50a-LTLFireability-01: LTL unknown AGGR
DES-PT-50a-LTLFireability-08: LTL unknown AGGR
DES-PT-50a-LTLFireability-09: LTL false LTL model checker
DES-PT-50a-LTLFireability-12: LTL unknown AGGR
DES-PT-50a-LTLFireability-13: LTL unknown AGGR


Time elapsed: 321 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-50a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r103-tall-167814478400476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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