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-167814478300468.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-40b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300468
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:36 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 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 115K 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-40b-LTLFireability-00
FORMULA_NAME DES-PT-40b-LTLFireability-01
FORMULA_NAME DES-PT-40b-LTLFireability-02
FORMULA_NAME DES-PT-40b-LTLFireability-03
FORMULA_NAME DES-PT-40b-LTLFireability-04
FORMULA_NAME DES-PT-40b-LTLFireability-05
FORMULA_NAME DES-PT-40b-LTLFireability-06
FORMULA_NAME DES-PT-40b-LTLFireability-07
FORMULA_NAME DES-PT-40b-LTLFireability-08
FORMULA_NAME DES-PT-40b-LTLFireability-09
FORMULA_NAME DES-PT-40b-LTLFireability-10
FORMULA_NAME DES-PT-40b-LTLFireability-11
FORMULA_NAME DES-PT-40b-LTLFireability-12
FORMULA_NAME DES-PT-40b-LTLFireability-13
FORMULA_NAME DES-PT-40b-LTLFireability-14
FORMULA_NAME DES-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678253400901

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-40b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:30:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:30:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:30:02] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-08 05:30:02] [INFO ] Transformed 439 places.
[2023-03-08 05:30:02] [INFO ] Transformed 390 transitions.
[2023-03-08 05:30:02] [INFO ] Found NUPN structural information;
[2023-03-08 05:30:02] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 120 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-40b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 415 transition count 369
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 415 transition count 369
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 402 transition count 356
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 402 transition count 356
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 402 transition count 347
Applied a total of 80 rules in 83 ms. Remains 402 /439 variables (removed 37) and now considering 347/390 (removed 43) transitions.
// Phase 1: matrix 347 rows 402 cols
[2023-03-08 05:30:02] [INFO ] Computed 62 place invariants in 41 ms
[2023-03-08 05:30:03] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-08 05:30:03] [INFO ] Invariant cache hit.
[2023-03-08 05:30:03] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2023-03-08 05:30:03] [INFO ] Invariant cache hit.
[2023-03-08 05:30:03] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/439 places, 347/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1208 ms. Remains : 402/439 places, 347/390 transitions.
Support contains 40 out of 402 places after structural reductions.
[2023-03-08 05:30:03] [INFO ] Flatten gal took : 53 ms
[2023-03-08 05:30:03] [INFO ] Flatten gal took : 25 ms
[2023-03-08 05:30:04] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 38 out of 402 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 05:30:04] [INFO ] Invariant cache hit.
[2023-03-08 05:30:05] [INFO ] [Real]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 05:30:05] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 24 ms returned sat
[2023-03-08 05:30:05] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 05:30:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 05:30:05] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 74 ms returned sat
[2023-03-08 05:30:05] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 4 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 0 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 457 ms
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2023-03-08 05:30:06] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2023-03-08 05:30:07] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2023-03-08 05:30:07] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2023-03-08 05:30:07] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2023-03-08 05:30:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 598 ms
[2023-03-08 05:30:07] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2023-03-08 05:30:07] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 0 ms to minimize.
[2023-03-08 05:30:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 292 ms
[2023-03-08 05:30:07] [INFO ] After 2323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 588 ms.
[2023-03-08 05:30:08] [INFO ] After 3293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 1 properties in 1169 ms.
Support contains 13 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 396 transition count 328
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 31 place count 382 transition count 328
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 382 transition count 317
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 371 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 367 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 367 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 366 transition count 311
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 363 transition count 308
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 363 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 74 place count 363 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 76 place count 362 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 76 place count 362 transition count 301
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 80 place count 360 transition count 301
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 6 with 146 rules applied. Total rules applied 226 place count 287 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 285 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 285 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 284 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 283 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 282 transition count 228
Applied a total of 234 rules in 173 ms. Remains 282 /402 variables (removed 120) and now considering 228/347 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 282/402 places, 228/347 transitions.
Incomplete random walk after 10000 steps, including 407 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 622497 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622497 steps, saw 95434 distinct states, run finished after 3002 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 228 rows 282 cols
[2023-03-08 05:30:13] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:30:13] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:30:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 05:30:13] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 05:30:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:30:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 104 ms returned sat
[2023-03-08 05:30:14] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 05:30:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:30:14] [INFO ] After 182ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-08 05:30:14] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-08 05:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 05:30:14] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-08 05:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-08 05:30:14] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-08 05:30:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 05:30:14] [INFO ] After 723ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-08 05:30:14] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 176 ms.
Support contains 13 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 282/282 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2023-03-08 05:30:15] [INFO ] Invariant cache hit.
[2023-03-08 05:30:15] [INFO ] Implicit Places using invariants in 236 ms returned []
[2023-03-08 05:30:15] [INFO ] Invariant cache hit.
[2023-03-08 05:30:15] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:30:15] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-08 05:30:15] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 05:30:15] [INFO ] Invariant cache hit.
[2023-03-08 05:30:15] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 796 ms. Remains : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 27 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Running SMT prover for 9 properties.
[2023-03-08 05:30:15] [INFO ] Invariant cache hit.
[2023-03-08 05:30:16] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 05:30:16] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-08 05:30:16] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 05:30:16] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 05:30:16] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 142 ms returned sat
[2023-03-08 05:30:16] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 05:30:16] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-08 05:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-08 05:30:17] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-08 05:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 05:30:17] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 4 ms to minimize.
[2023-03-08 05:30:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-08 05:30:17] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 199 ms.
[2023-03-08 05:30:17] [INFO ] After 1375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U X(X(G(p1)))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 46 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:30:17] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 05:30:18] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-08 05:30:18] [INFO ] Invariant cache hit.
[2023-03-08 05:30:18] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 850 ms to find 0 implicit places.
[2023-03-08 05:30:18] [INFO ] Invariant cache hit.
[2023-03-08 05:30:18] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 453 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : DES-PT-40b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s182 1)), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-00 finished in 1611 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 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 398 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 398 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 398 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 396 transition count 340
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 396 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 396 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 395 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 395 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 395 transition count 336
Applied a total of 18 rules in 37 ms. Remains 395 /402 variables (removed 7) and now considering 336/347 (removed 11) transitions.
// Phase 1: matrix 336 rows 395 cols
[2023-03-08 05:30:19] [INFO ] Computed 62 place invariants in 5 ms
[2023-03-08 05:30:19] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-08 05:30:19] [INFO ] Invariant cache hit.
[2023-03-08 05:30:19] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2023-03-08 05:30:19] [INFO ] Invariant cache hit.
[2023-03-08 05:30:20] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/402 places, 336/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 395/402 places, 336/347 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-01 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:(EQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-01 finished in 936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 28 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:30:20] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 05:30:20] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 05:30:20] [INFO ] Invariant cache hit.
[2023-03-08 05:30:20] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-08 05:30:20] [INFO ] Invariant cache hit.
[2023-03-08 05:30:21] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 904 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s305 1) (EQ s337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 5 ms.
FORMULA DES-PT-40b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-02 finished in 1021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0&&F(p1)))))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 26 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
[2023-03-08 05:30:21] [INFO ] Invariant cache hit.
[2023-03-08 05:30:21] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 05:30:21] [INFO ] Invariant cache hit.
[2023-03-08 05:30:21] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2023-03-08 05:30:21] [INFO ] Invariant cache hit.
[2023-03-08 05:30:22] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 855 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s113 1) (EQ s242 1)), p0:(OR (EQ s76 0) (EQ s385 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 3 ms.
FORMULA DES-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-04 finished in 1050 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 33 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
[2023-03-08 05:30:22] [INFO ] Invariant cache hit.
[2023-03-08 05:30:22] [INFO ] Implicit Places using invariants in 208 ms returned []
[2023-03-08 05:30:22] [INFO ] Invariant cache hit.
[2023-03-08 05:30:22] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-08 05:30:22] [INFO ] Invariant cache hit.
[2023-03-08 05:30:23] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 202 ms :[true, p1, p0, p0, (AND p0 p1), p0, p0]
Running random walk in product with property : DES-PT-40b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s157 1) (EQ s182 1)), p0:(AND (EQ s84 1) (EQ s385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 880 reset in 317 ms.
Product exploration explored 100000 steps with 892 reset in 235 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 301 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:30:24] [INFO ] Invariant cache hit.
[2023-03-08 05:30:24] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:30:24] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-08 05:30:24] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:30:24] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 25 ms returned sat
[2023-03-08 05:30:24] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:24] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-08 05:30:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-08 05:30:24] [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 31 ms.
[2023-03-08 05:30:25] [INFO ] After 456ms 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 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 57 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 429 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 87 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1592911 steps, run timeout after 3001 ms. (steps per millisecond=530 ) properties seen :{}
Probabilistic random walk after 1592911 steps, saw 217652 distinct states, run finished after 3012 ms. (steps per millisecond=528 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 05:30:28] [INFO ] Computed 60 place invariants in 14 ms
[2023-03-08 05:30:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:30:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:30:28] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 05:30:28] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:30:28] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:28] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 05:30:28] [INFO ] After 319ms 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 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-08 05:30:28] [INFO ] Invariant cache hit.
[2023-03-08 05:30:28] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 05:30:28] [INFO ] Invariant cache hit.
[2023-03-08 05:30:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:30:29] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2023-03-08 05:30:29] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 05:30:29] [INFO ] Invariant cache hit.
[2023-03-08 05:30:29] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 635 ms. Remains : 278/278 places, 224/224 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 278 transition count 224
Applied a total of 1 rules in 12 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 05:30:29] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:30:29] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 05:30:29] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 05:30:29] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:29] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:30:29] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 177 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:30:30] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 05:30:30] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 05:30:30] [INFO ] Invariant cache hit.
[2023-03-08 05:30:30] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2023-03-08 05:30:30] [INFO ] Invariant cache hit.
[2023-03-08 05:30:31] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:30:31] [INFO ] Invariant cache hit.
[2023-03-08 05:30:31] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:30:31] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 23 ms returned sat
[2023-03-08 05:30:31] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 05:30:31] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-08 05:30:31] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:31] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2023-03-08 05:30:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2023-03-08 05:30:31] [INFO ] After 331ms 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:30:31] [INFO ] After 456ms 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 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 60 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 462 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1518933 steps, run timeout after 3001 ms. (steps per millisecond=506 ) properties seen :{}
Probabilistic random walk after 1518933 steps, saw 207680 distinct states, run finished after 3001 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 05:30:35] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:30:35] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:30:35] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:30:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-08 05:30:35] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:30:35] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:35] [INFO ] After 35ms 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:30:35] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-08 05:30:35] [INFO ] Invariant cache hit.
[2023-03-08 05:30:35] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 05:30:35] [INFO ] Invariant cache hit.
[2023-03-08 05:30:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 05:30:35] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-08 05:30:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:30:35] [INFO ] Invariant cache hit.
[2023-03-08 05:30:36] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 601 ms. Remains : 278/278 places, 224/224 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 278 transition count 224
Applied a total of 1 rules in 10 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 05:30:36] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:30:36] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:30:36] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 05:30:36] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:30:36] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2023-03-08 05:30:36] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:36] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 05:30:36] [INFO ] After 318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 278 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 189 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 866 reset in 196 ms.
Product exploration explored 100000 steps with 874 reset in 192 ms.
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 14 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:30:37] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 05:30:38] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-08 05:30:38] [INFO ] Invariant cache hit.
[2023-03-08 05:30:38] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-08 05:30:38] [INFO ] Invariant cache hit.
[2023-03-08 05:30:38] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 754 ms. Remains : 393/393 places, 333/333 transitions.
Treatment of property DES-PT-40b-LTLFireability-05 finished in 16399 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((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Support contains 9 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 319
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 70 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 6 with 152 rules applied. Total rules applied 228 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 279 transition count 227
Applied a total of 235 rules in 80 ms. Remains 279 /402 variables (removed 123) and now considering 227/347 (removed 120) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:30:38] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:30:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-08 05:30:38] [INFO ] Invariant cache hit.
[2023-03-08 05:30:39] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-08 05:30:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 05:30:39] [INFO ] Invariant cache hit.
[2023-03-08 05:30:39] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/402 places, 227/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 612 ms. Remains : 279/402 places, 227/347 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s202 1) (EQ s204 1) (EQ s206 1) (EQ s208 1) (EQ s210 1) (EQ s212 1) (EQ s214 1) (EQ s216 1)), p0:(OR (EQ s202 0) (EQ s204 0) (EQ s206 0) (EQ s...], nbAcceptance=1, 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 33179 reset in 324 ms.
Product exploration explored 100000 steps with 33431 reset in 375 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 251 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 532 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:30:40] [INFO ] Invariant cache hit.
[2023-03-08 05:30:40] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:40] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 05:30:40] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 49 ms returned sat
[2023-03-08 05:30:40] [INFO ] After 112ms 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 (NOT p1) p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p0))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 05:30:41] [INFO ] Invariant cache hit.
[2023-03-08 05:30:41] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-08 05:30:41] [INFO ] Invariant cache hit.
[2023-03-08 05:30:41] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-08 05:30:41] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 05:30:41] [INFO ] Invariant cache hit.
[2023-03-08 05:30:41] [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 579 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 265 steps, including 14 resets, run visited all 2 properties in 4 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33145 reset in 260 ms.
Product exploration explored 100000 steps with 33381 reset in 276 ms.
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 05:30:43] [INFO ] Invariant cache hit.
[2023-03-08 05:30:43] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-08 05:30:43] [INFO ] Invariant cache hit.
[2023-03-08 05:30:43] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-08 05:30:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:30:43] [INFO ] Invariant cache hit.
[2023-03-08 05:30:43] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 599 ms. Remains : 279/279 places, 227/227 transitions.
Treatment of property DES-PT-40b-LTLFireability-06 finished in 4984 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)))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 382 transition count 320
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 47 place count 372 transition count 320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 368 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 368 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 367 transition count 314
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 364 transition count 311
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 364 transition count 311
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 68 place count 364 transition count 307
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 70 place count 363 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 70 place count 363 transition count 304
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 74 place count 361 transition count 304
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 228 place count 284 transition count 227
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 279 transition count 227
Applied a total of 235 rules in 57 ms. Remains 279 /402 variables (removed 123) and now considering 227/347 (removed 120) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:30:43] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 05:30:43] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:30:43] [INFO ] Invariant cache hit.
[2023-03-08 05:30:44] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-08 05:30:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:30:44] [INFO ] Invariant cache hit.
[2023-03-08 05:30:44] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/402 places, 227/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 665 ms. Remains : 279/402 places, 227/347 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s258 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 26 steps with 1 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-07 finished in 744 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))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 33 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:30:44] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 05:30:44] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-08 05:30:44] [INFO ] Invariant cache hit.
[2023-03-08 05:30:45] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2023-03-08 05:30:45] [INFO ] Invariant cache hit.
[2023-03-08 05:30:45] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 819 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-08 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:(EQ s387 0), p0:(OR (EQ s60 0) (EQ s385 0))], 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]]
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-08 finished in 961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Support contains 5 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 381 transition count 320
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 372 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 369 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 369 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 369 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 366 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 366 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 366 transition count 309
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 66 place count 364 transition count 309
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 218 place count 288 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 288 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 286 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 284 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 283 transition count 235
Applied a total of 226 rules in 66 ms. Remains 283 /402 variables (removed 119) and now considering 235/347 (removed 112) transitions.
// Phase 1: matrix 235 rows 283 cols
[2023-03-08 05:30:45] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:30:45] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:30:45] [INFO ] Invariant cache hit.
[2023-03-08 05:30:45] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2023-03-08 05:30:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 05:30:45] [INFO ] Invariant cache hit.
[2023-03-08 05:30:46] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/402 places, 235/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 622 ms. Remains : 283/402 places, 235/347 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR p2 p1), p2, p1]
Running random walk in product with property : DES-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s164 1) (AND (EQ s84 1) (EQ s192 1))), p2:(AND (EQ s84 1) (EQ s192 1)), p1:(AND (EQ s200 1) (EQ s204 1))], nbAcceptance=1, 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 4723 reset in 269 ms.
Product exploration explored 100000 steps with 4743 reset in 278 ms.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/283 stabilizing places and 171/235 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[p2]
Incomplete random walk after 10000 steps, including 463 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1537862 steps, run timeout after 3001 ms. (steps per millisecond=512 ) properties seen :{}
Probabilistic random walk after 1537862 steps, saw 196178 distinct states, run finished after 3001 ms. (steps per millisecond=512 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:30:50] [INFO ] Invariant cache hit.
[2023-03-08 05:30:50] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:50] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:30:50] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 05:30:50] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:50] [INFO ] After 380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 05:30:50] [INFO ] After 500ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 283 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 282 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 280 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 280 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 280 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 278 transition count 225
Applied a total of 15 rules in 26 ms. Remains 278 /283 variables (removed 5) and now considering 225/235 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 278/283 places, 225/235 transitions.
Incomplete random walk after 10000 steps, including 507 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 79 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1545720 steps, run timeout after 3001 ms. (steps per millisecond=515 ) properties seen :{}
Probabilistic random walk after 1545720 steps, saw 208818 distinct states, run finished after 3001 ms. (steps per millisecond=515 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2023-03-08 05:30:53] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 05:30:53] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:53] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 05:30:54] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:30:54] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-08 05:30:54] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:54] [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 15 ms.
[2023-03-08 05:30:54] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-08 05:30:54] [INFO ] Invariant cache hit.
[2023-03-08 05:30:54] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 05:30:54] [INFO ] Invariant cache hit.
[2023-03-08 05:30:54] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-08 05:30:54] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:30:54] [INFO ] Invariant cache hit.
[2023-03-08 05:30:54] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 549 ms. Remains : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:30:54] [INFO ] Invariant cache hit.
[2023-03-08 05:30:54] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:54] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 05:30:54] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 63 ms returned sat
[2023-03-08 05:30:55] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:30:55] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 05:30:55] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 392 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 46 ms :[p2]
Stuttering acceptance computed with spot in 25 ms :[p2]
Support contains 2 out of 283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 235/235 transitions.
Applied a total of 0 rules in 8 ms. Remains 283 /283 variables (removed 0) and now considering 235/235 (removed 0) transitions.
// Phase 1: matrix 235 rows 283 cols
[2023-03-08 05:30:55] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 05:30:55] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 05:30:55] [INFO ] Invariant cache hit.
[2023-03-08 05:30:56] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-08 05:30:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:30:56] [INFO ] Invariant cache hit.
[2023-03-08 05:30:56] [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 571 ms. Remains : 283/283 places, 235/235 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/283 stabilizing places and 171/235 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
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 24 ms :[p2]
Incomplete random walk after 10000 steps, including 481 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1625693 steps, run timeout after 3001 ms. (steps per millisecond=541 ) properties seen :{}
Probabilistic random walk after 1625693 steps, saw 206719 distinct states, run finished after 3001 ms. (steps per millisecond=541 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:30:59] [INFO ] Invariant cache hit.
[2023-03-08 05:30:59] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:59] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 05:30:59] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:30:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:30:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 05:31:00] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:00] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:31:00] [INFO ] After 489ms 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 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 283 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 282 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 280 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 280 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 280 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 278 transition count 225
Applied a total of 15 rules in 22 ms. Remains 278 /283 variables (removed 5) and now considering 225/235 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 278/283 places, 225/235 transitions.
Incomplete random walk after 10000 steps, including 497 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 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1629607 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :{}
Probabilistic random walk after 1629607 steps, saw 218940 distinct states, run finished after 3001 ms. (steps per millisecond=543 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2023-03-08 05:31:03] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:31:03] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:31:03] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 05:31:03] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:31:03] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 34 ms returned sat
[2023-03-08 05:31:03] [INFO ] After 179ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:03] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:31:03] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-08 05:31:03] [INFO ] Invariant cache hit.
[2023-03-08 05:31:03] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 05:31:03] [INFO ] Invariant cache hit.
[2023-03-08 05:31:04] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-08 05:31:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:04] [INFO ] Invariant cache hit.
[2023-03-08 05:31:04] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 594 ms. Remains : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:31:04] [INFO ] Invariant cache hit.
[2023-03-08 05:31:04] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:31:04] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 05:31:04] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:31:04] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 60 ms returned sat
[2023-03-08 05:31:04] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:04] [INFO ] After 181ms 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:31:04] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 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 24 ms :[p2]
Stuttering acceptance computed with spot in 27 ms :[p2]
Stuttering acceptance computed with spot in 32 ms :[p2]
Product exploration explored 100000 steps with 4678 reset in 222 ms.
Product exploration explored 100000 steps with 4723 reset in 241 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 235/235 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 283 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 281 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 280 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 280 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 280 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 279 transition count 227
Applied a total of 12 rules in 22 ms. Remains 279 /283 variables (removed 4) and now considering 227/235 (removed 8) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:31:05] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 05:31:05] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 05:31:05] [INFO ] Invariant cache hit.
[2023-03-08 05:31:05] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2023-03-08 05:31:05] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:05] [INFO ] Invariant cache hit.
[2023-03-08 05:31:05] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/283 places, 227/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 279/283 places, 227/235 transitions.
Treatment of property DES-PT-40b-LTLFireability-09 finished in 20486 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((X(X(F(p1)))||p0))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 382 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 367 transition count 315
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 367 transition count 315
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 364 transition count 312
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 364 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 363 transition count 308
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 68 place count 363 transition count 306
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 361 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 222 place count 286 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 284 transition count 236
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 281 transition count 230
Applied a total of 233 rules in 44 ms. Remains 281 /402 variables (removed 121) and now considering 230/347 (removed 117) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 05:31:05] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:31:06] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-08 05:31:06] [INFO ] Invariant cache hit.
[2023-03-08 05:31:06] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-08 05:31:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:06] [INFO ] Invariant cache hit.
[2023-03-08 05:31:06] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/402 places, 230/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 281/402 places, 230/347 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s276 0)), p1:(OR (EQ s166 0) (EQ s190 0))], 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 4647 reset in 210 ms.
Product exploration explored 100000 steps with 4629 reset in 233 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 187 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 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 463 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:31:07] [INFO ] Invariant cache hit.
[2023-03-08 05:31:07] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 05:31:07] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 32 ms returned sat
[2023-03-08 05:31:07] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:07] [INFO ] After 181ms 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:31:07] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 23 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 451 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 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1662097 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :{}
Probabilistic random walk after 1662097 steps, saw 213554 distinct states, run finished after 3001 ms. (steps per millisecond=553 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:31:10] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 05:31:10] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:31:10] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-08 05:31:11] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:11] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2023-03-08 05:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-08 05:31:11] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 05:31:11] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 6 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 05:31:11] [INFO ] Invariant cache hit.
[2023-03-08 05:31:11] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-08 05:31:11] [INFO ] Invariant cache hit.
[2023-03-08 05:31:11] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-08 05:31:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:31:11] [INFO ] Invariant cache hit.
[2023-03-08 05:31:11] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 580 ms. Remains : 279/279 places, 227/227 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 279 transition count 227
Applied a total of 1 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:31:11] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 05:31:11] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:31:11] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2023-03-08 05:31:12] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:12] [INFO ] After 231ms 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:31:12] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 226 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 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 11 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 05:31:12] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 05:31:12] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:31:12] [INFO ] Invariant cache hit.
[2023-03-08 05:31:13] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-08 05:31:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:13] [INFO ] Invariant cache hit.
[2023-03-08 05:31:13] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 575 ms. Remains : 281/281 places, 230/230 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 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 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 169 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 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 452 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 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:31:13] [INFO ] Invariant cache hit.
[2023-03-08 05:31:13] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 05:31:13] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 05:31:13] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:13] [INFO ] After 191ms 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:31:13] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 21 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 464 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1702103 steps, run timeout after 3001 ms. (steps per millisecond=567 ) properties seen :{}
Probabilistic random walk after 1702103 steps, saw 218281 distinct states, run finished after 3001 ms. (steps per millisecond=567 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:31:16] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 05:31:17] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:31:17] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2023-03-08 05:31:17] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:17] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2023-03-08 05:31:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-08 05:31:17] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 05:31:17] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 5 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 05:31:17] [INFO ] Invariant cache hit.
[2023-03-08 05:31:17] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 05:31:17] [INFO ] Invariant cache hit.
[2023-03-08 05:31:17] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
[2023-03-08 05:31:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:31:17] [INFO ] Invariant cache hit.
[2023-03-08 05:31:18] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 279/279 places, 227/227 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 279 transition count 227
Applied a total of 1 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 05:31:18] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 05:31:18] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:31:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:31:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-08 05:31:18] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:31:18] [INFO ] After 220ms 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:31:18] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 435 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 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 53 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 4621 reset in 219 ms.
Product exploration explored 100000 steps with 4537 reset in 235 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 05:31:19] [INFO ] Computed 58 place invariants in 13 ms
[2023-03-08 05:31:19] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 05:31:19] [INFO ] Invariant cache hit.
[2023-03-08 05:31:19] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2023-03-08 05:31:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:19] [INFO ] Invariant cache hit.
[2023-03-08 05:31:20] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 281/281 places, 230/230 transitions.
Treatment of property DES-PT-40b-LTLFireability-10 finished in 14234 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 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 382 transition count 319
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 70 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 230 place count 283 transition count 226
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 234 place count 281 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 279 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 278 transition count 226
Applied a total of 237 rules in 44 ms. Remains 278 /402 variables (removed 124) and now considering 226/347 (removed 121) transitions.
// Phase 1: matrix 226 rows 278 cols
[2023-03-08 05:31:20] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:31:20] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 05:31:20] [INFO ] Invariant cache hit.
[2023-03-08 05:31:20] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-08 05:31:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:31:20] [INFO ] Invariant cache hit.
[2023-03-08 05:31:20] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/402 places, 226/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 599 ms. Remains : 278/402 places, 226/347 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s176 0)], 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 5486 reset in 209 ms.
Product exploration explored 100000 steps with 5434 reset in 221 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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 30 ms :[(NOT p0)]
Finished random walk after 1947 steps, including 101 resets, run visited all 1 properties in 5 ms. (steps per millisecond=389 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-08 05:31:21] [INFO ] Invariant cache hit.
[2023-03-08 05:31:21] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 05:31:21] [INFO ] Invariant cache hit.
[2023-03-08 05:31:21] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-08 05:31:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:21] [INFO ] Invariant cache hit.
[2023-03-08 05:31:22] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 565 ms. Remains : 278/278 places, 226/226 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 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 46 ms :[(NOT p0)]
Finished random walk after 2478 steps, including 142 resets, run visited all 1 properties in 10 ms. (steps per millisecond=247 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 134 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5467 reset in 205 ms.
Stack based approach found an accepted trace after 33261 steps with 1825 reset with depth 63 and stack size 63 in 70 ms.
FORMULA DES-PT-40b-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property DES-PT-40b-LTLFireability-11 finished in 2652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 30 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 05:31:22] [INFO ] Computed 62 place invariants in 9 ms
[2023-03-08 05:31:22] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 05:31:22] [INFO ] Invariant cache hit.
[2023-03-08 05:31:23] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-08 05:31:23] [INFO ] Invariant cache hit.
[2023-03-08 05:31:23] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s163 1) (NEQ s182 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 210 ms.
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-13 finished in 1479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 381 transition count 318
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 51 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 367 transition count 315
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 364 transition count 311
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 364 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 67 place count 364 transition count 308
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 69 place count 363 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 363 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 71 place count 362 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 221 place count 287 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 225 place count 285 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 283 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 228 place count 282 transition count 231
Applied a total of 228 rules in 48 ms. Remains 282 /402 variables (removed 120) and now considering 231/347 (removed 116) transitions.
// Phase 1: matrix 231 rows 282 cols
[2023-03-08 05:31:24] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:31:24] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 05:31:24] [INFO ] Invariant cache hit.
[2023-03-08 05:31:24] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2023-03-08 05:31:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:31:24] [INFO ] Invariant cache hit.
[2023-03-08 05:31:24] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/402 places, 231/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 282/402 places, 231/347 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s171 1), p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-14 finished in 699 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U G(p1))||F(p0)))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 319
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 70 place count 363 transition count 306
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 226 place count 285 transition count 228
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 230 place count 283 transition count 230
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 281 transition count 228
Applied a total of 232 rules in 53 ms. Remains 281 /402 variables (removed 121) and now considering 228/347 (removed 119) transitions.
// Phase 1: matrix 228 rows 281 cols
[2023-03-08 05:31:25] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-08 05:31:25] [INFO ] Implicit Places using invariants in 150 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 151 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/402 places, 228/347 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 280/402 places, 228/347 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s20 1) (EQ s193 1)), p1:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-15 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(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' '!(G((F(G((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((!p0&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!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((X(X(F(p1)))||p0))))'
[2023-03-08 05:31:25] [INFO ] Flatten gal took : 21 ms
[2023-03-08 05:31:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 05:31:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 402 places, 347 transitions and 1193 arcs took 3 ms.
Total runtime 83343 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-40b
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678254305369

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
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: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 3 DES-PT-40b-LTLFireability-06
lola: time limit : 720 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-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/720 3/32 DES-PT-40b-LTLFireability-06 417649 m, 83529 m/sec, 2189333 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/720 6/32 DES-PT-40b-LTLFireability-06 819911 m, 80452 m/sec, 4405060 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/720 9/32 DES-PT-40b-LTLFireability-06 1203753 m, 76768 m/sec, 6614201 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/720 11/32 DES-PT-40b-LTLFireability-06 1555737 m, 70396 m/sec, 8823831 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/720 13/32 DES-PT-40b-LTLFireability-06 1894833 m, 67819 m/sec, 11035426 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/720 15/32 DES-PT-40b-LTLFireability-06 2228873 m, 66808 m/sec, 13243010 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/720 18/32 DES-PT-40b-LTLFireability-06 2573215 m, 68868 m/sec, 15446331 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/720 20/32 DES-PT-40b-LTLFireability-06 2912449 m, 67846 m/sec, 17659375 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/720 22/32 DES-PT-40b-LTLFireability-06 3251485 m, 67807 m/sec, 19871712 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/720 24/32 DES-PT-40b-LTLFireability-06 3587321 m, 67167 m/sec, 22080046 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 55/720 27/32 DES-PT-40b-LTLFireability-06 3964509 m, 75437 m/sec, 24263323 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 60/720 29/32 DES-PT-40b-LTLFireability-06 4324207 m, 71939 m/sec, 26433052 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 1 0 2 0 0 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 65/720 32/32 DES-PT-40b-LTLFireability-06 4643671 m, 63892 m/sec, 28618889 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 8 (type EXCL) for DES-PT-40b-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 0 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 11 (type EXCL) for 10 DES-PT-40b-LTLFireability-09
lola: time limit : 882 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-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 0 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/882 14/32 DES-PT-40b-LTLFireability-09 1675114 m, 335022 m/sec, 2064478 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 0 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/882 26/32 DES-PT-40b-LTLFireability-09 3272142 m, 319405 m/sec, 4099088 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 11 (type EXCL) for DES-PT-40b-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 1 0 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 6 (type EXCL) for 3 DES-PT-40b-LTLFireability-06
lola: time limit : 1171 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-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 1 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 5/1171 6/32 DES-PT-40b-LTLFireability-06 711916 m, 142383 m/sec, 2582441 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 1 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 10/1171 11/32 DES-PT-40b-LTLFireability-06 1373145 m, 132245 m/sec, 5118121 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 1 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 15/1171 17/32 DES-PT-40b-LTLFireability-06 2050321 m, 135435 m/sec, 7696964 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 1 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 20/1171 22/32 DES-PT-40b-LTLFireability-06 2725200 m, 134975 m/sec, 10271775 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 1 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 25/1171 27/32 DES-PT-40b-LTLFireability-06 3382589 m, 131477 m/sec, 12793259 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 1 0 2 0 1 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 30/1171 32/32 DES-PT-40b-LTLFireability-06 4067191 m, 136920 m/sec, 15374229 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-40b-LTLFireability-05: LTL 1 0 0 0 1 0 0 0
DES-PT-40b-LTLFireability-06: CONJ 0 0 0 0 2 0 2 0
DES-PT-40b-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
DES-PT-40b-LTLFireability-10: LTL 1 0 0 0 1 0 0 0

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

Time elapsed: 816 secs. Pages in use: 32
# running tasks: 0 of 4 Visible: 4
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 2074 Killed lola --conf=$BIN_DIR/configfiles/ltlfireabilityconf --formula=$DIR/LTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

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-40b"
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-40b, 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-167814478300468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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