About the Execution of LoLa+red for PolyORBLF-PT-S06J06T04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2400.420 | 645420.00 | 683294.00 | 2096.70 | FFFFFFFFF?TFFFFF | normal |
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.r295-tall-167873948100612.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 PolyORBLF-PT-S06J06T04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948100612
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 16K Feb 26 13:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 223K Feb 26 13:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 956K Feb 26 13:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 211K Feb 25 16:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 658K Feb 25 16:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Feb 26 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 167K Feb 26 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 773K Feb 26 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.9M Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-00
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-01
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-02
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-03
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-04
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-05
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-06
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-07
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-08
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-09
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-10
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-11
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-12
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-13
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-14
FORMULA_NAME PolyORBLF-PT-S06J06T04-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678875011064
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=PolyORBLF-PT-S06J06T04
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 10:10:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 10:10:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:10:12] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2023-03-15 10:10:12] [INFO ] Transformed 506 places.
[2023-03-15 10:10:13] [INFO ] Transformed 7154 transitions.
[2023-03-15 10:10:13] [INFO ] Parsed PT model containing 506 places and 7154 transitions and 59824 arcs in 492 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
[2023-03-15 10:10:13] [INFO ] Reduced 4680 identical enabling conditions.
[2023-03-15 10:10:13] [INFO ] Reduced 4680 identical enabling conditions.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 111 out of 506 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 506/506 places, 1774/1774 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 500 transition count 1774
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 496 transition count 1770
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 496 transition count 1770
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 493 transition count 1767
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 493 transition count 1767
Applied a total of 20 rules in 252 ms. Remains 493 /506 variables (removed 13) and now considering 1767/1774 (removed 7) transitions.
[2023-03-15 10:10:13] [INFO ] Flow matrix only has 1743 transitions (discarded 24 similar events)
// Phase 1: matrix 1743 rows 493 cols
[2023-03-15 10:10:13] [INFO ] Computed 48 place invariants in 97 ms
[2023-03-15 10:10:15] [INFO ] Dead Transitions using invariants and state equation in 1524 ms found 612 transitions.
Found 612 dead transitions using SMT.
Drop transitions removed 612 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 612 transitions.
[2023-03-15 10:10:15] [INFO ] Flow matrix only has 1131 transitions (discarded 24 similar events)
// Phase 1: matrix 1131 rows 493 cols
[2023-03-15 10:10:15] [INFO ] Computed 48 place invariants in 29 ms
[2023-03-15 10:10:15] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-15 10:10:15] [INFO ] Flow matrix only has 1131 transitions (discarded 24 similar events)
[2023-03-15 10:10:15] [INFO ] Invariant cache hit.
[2023-03-15 10:10:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:10:26] [INFO ] Implicit Places using invariants and state equation in 10820 ms returned []
Implicit Place search using SMT with State Equation took 11151 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 493/506 places, 1155/1774 transitions.
Applied a total of 0 rules in 12 ms. Remains 493 /493 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12966 ms. Remains : 493/506 places, 1155/1774 transitions.
Support contains 111 out of 493 places after structural reductions.
[2023-03-15 10:10:26] [INFO ] Flatten gal took : 167 ms
[2023-03-15 10:10:26] [INFO ] Flatten gal took : 97 ms
[2023-03-15 10:10:27] [INFO ] Input system was already deterministic with 1155 transitions.
Support contains 79 out of 493 places (down from 111) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 57 resets, run finished after 402 ms. (steps per millisecond=24 ) properties (out of 32) seen :29
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-15 10:10:27] [INFO ] Flow matrix only has 1131 transitions (discarded 24 similar events)
[2023-03-15 10:10:27] [INFO ] Invariant cache hit.
[2023-03-15 10:10:28] [INFO ] [Real]Absence check using 17 positive place invariants in 3 ms returned sat
[2023-03-15 10:10:28] [INFO ] [Real]Absence check using 17 positive and 31 generalized place invariants in 28 ms returned sat
[2023-03-15 10:10:28] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 10:10:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 4 ms returned sat
[2023-03-15 10:10:28] [INFO ] [Nat]Absence check using 17 positive and 31 generalized place invariants in 32 ms returned sat
[2023-03-15 10:10:33] [INFO ] After 4765ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 10:10:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:10:34] [INFO ] After 1855ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 10:10:36] [INFO ] After 3032ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 647 ms.
[2023-03-15 10:10:36] [INFO ] After 8582ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 493 transition count 1131
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 469 transition count 1131
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 48 place count 469 transition count 1075
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 160 place count 413 transition count 1075
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 258 place count 364 transition count 1026
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 269 place count 364 transition count 1015
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 280 place count 353 transition count 1015
Applied a total of 280 rules in 151 ms. Remains 353 /493 variables (removed 140) and now considering 1015/1155 (removed 140) transitions.
[2023-03-15 10:10:36] [INFO ] Flow matrix only has 991 transitions (discarded 24 similar events)
// Phase 1: matrix 991 rows 353 cols
[2023-03-15 10:10:36] [INFO ] Computed 48 place invariants in 15 ms
[2023-03-15 10:10:37] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 714 ms. Remains : 353/493 places, 1015/1155 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished probabilistic random walk after 664 steps, run visited all 1 properties in 20 ms. (steps per millisecond=33 )
Probabilistic random walk after 664 steps, saw 512 distinct states, run finished after 20 ms. (steps per millisecond=33 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)&&F(G(p1)))))'
Support contains 32 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1155/1155 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 16 rules applied. Total rules applied 16 place count 493 transition count 1139
Reduce places removed 16 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 20 rules applied. Total rules applied 36 place count 477 transition count 1135
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 473 transition count 1135
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 40 place count 473 transition count 1075
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 160 place count 413 transition count 1075
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 234 place count 376 transition count 1038
Applied a total of 234 rules in 73 ms. Remains 376 /493 variables (removed 117) and now considering 1038/1155 (removed 117) transitions.
[2023-03-15 10:10:38] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
// Phase 1: matrix 1014 rows 376 cols
[2023-03-15 10:10:38] [INFO ] Computed 48 place invariants in 17 ms
[2023-03-15 10:10:38] [INFO ] Dead Transitions using invariants and state equation in 611 ms found 0 transitions.
[2023-03-15 10:10:38] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:38] [INFO ] Invariant cache hit.
[2023-03-15 10:10:38] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-15 10:10:38] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:38] [INFO ] Invariant cache hit.
[2023-03-15 10:10:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:10:46] [INFO ] Implicit Places using invariants and state equation in 8048 ms returned []
Implicit Place search using SMT with State Equation took 8377 ms to find 0 implicit places.
[2023-03-15 10:10:47] [INFO ] Redundant transitions in 69 ms returned []
[2023-03-15 10:10:47] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:47] [INFO ] Invariant cache hit.
[2023-03-15 10:10:47] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/493 places, 1038/1155 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9740 ms. Remains : 376/493 places, 1038/1155 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s149 1) (LT s257 1) (LT s366 1)) (OR (LT s117 1) (LT s257 1) (LT s272 1)) (OR (LT s117 1) (LT s149 1) (LT s257 1)) (OR (LT s2 1) (LT s229 ...], 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 991 reset in 895 ms.
Product exploration explored 100000 steps with 965 reset in 817 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 78 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 32 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 1038/1038 transitions.
Applied a total of 0 rules in 27 ms. Remains 376 /376 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2023-03-15 10:10:50] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:50] [INFO ] Invariant cache hit.
[2023-03-15 10:10:51] [INFO ] Dead Transitions using invariants and state equation in 576 ms found 0 transitions.
[2023-03-15 10:10:51] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:51] [INFO ] Invariant cache hit.
[2023-03-15 10:10:51] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-15 10:10:51] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:51] [INFO ] Invariant cache hit.
[2023-03-15 10:10:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:10:59] [INFO ] Implicit Places using invariants and state equation in 7648 ms returned []
Implicit Place search using SMT with State Equation took 7970 ms to find 0 implicit places.
[2023-03-15 10:10:59] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-15 10:10:59] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:10:59] [INFO ] Invariant cache hit.
[2023-03-15 10:10:59] [INFO ] Dead Transitions using invariants and state equation in 592 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9207 ms. Remains : 376/376 places, 1038/1038 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 38 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 248 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 961 reset in 725 ms.
Product exploration explored 100000 steps with 955 reset in 749 ms.
Support contains 32 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 1038/1038 transitions.
Applied a total of 0 rules in 18 ms. Remains 376 /376 variables (removed 0) and now considering 1038/1038 (removed 0) transitions.
[2023-03-15 10:11:02] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:11:02] [INFO ] Invariant cache hit.
[2023-03-15 10:11:02] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2023-03-15 10:11:02] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:11:02] [INFO ] Invariant cache hit.
[2023-03-15 10:11:03] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-15 10:11:03] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:11:03] [INFO ] Invariant cache hit.
[2023-03-15 10:11:03] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:11:10] [INFO ] Implicit Places using invariants and state equation in 7800 ms returned []
Implicit Place search using SMT with State Equation took 8123 ms to find 0 implicit places.
[2023-03-15 10:11:10] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-15 10:11:10] [INFO ] Flow matrix only has 1014 transitions (discarded 24 similar events)
[2023-03-15 10:11:10] [INFO ] Invariant cache hit.
[2023-03-15 10:11:11] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9346 ms. Remains : 376/376 places, 1038/1038 transitions.
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-00 finished in 33779 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 9 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 19 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:11:11] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 492 cols
[2023-03-15 10:11:11] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-15 10:11:12] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
[2023-03-15 10:11:12] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:11:12] [INFO ] Invariant cache hit.
[2023-03-15 10:11:13] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-15 10:11:13] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:11:13] [INFO ] Invariant cache hit.
[2023-03-15 10:11:13] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:11:28] [INFO ] Implicit Places using invariants and state equation in 15819 ms returned []
Implicit Place search using SMT with State Equation took 16255 ms to find 0 implicit places.
[2023-03-15 10:11:28] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:11:28] [INFO ] Invariant cache hit.
[2023-03-15 10:11:29] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 492/493 places, 1154/1155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18233 ms. Remains : 492/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s56 1) (GEQ s101 1)) (AND (GEQ s22 1) (GEQ s31 1) (GEQ s228 1)) (AND (GEQ s31 1) (GEQ s148 1) (GEQ s410 1)) (AND (GEQ s31 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 1 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-02 finished in 18354 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 8 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 493 transition count 1127
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 465 transition count 1127
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 56 place count 465 transition count 1071
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 168 place count 409 transition count 1071
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 250 place count 368 transition count 1030
Applied a total of 250 rules in 50 ms. Remains 368 /493 variables (removed 125) and now considering 1030/1155 (removed 125) transitions.
[2023-03-15 10:11:30] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
// Phase 1: matrix 1006 rows 368 cols
[2023-03-15 10:11:30] [INFO ] Computed 48 place invariants in 21 ms
[2023-03-15 10:11:30] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
[2023-03-15 10:11:30] [INFO ] Flow matrix only has 1006 transitions (discarded 24 similar events)
[2023-03-15 10:11:30] [INFO ] Invariant cache hit.
[2023-03-15 10:11:31] [INFO ] Implicit Places using invariants in 377 ms returned [18, 73, 153, 306]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 380 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 364/493 places, 1030/1155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 360 transition count 1026
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 360 transition count 1026
Applied a total of 8 rules in 26 ms. Remains 360 /364 variables (removed 4) and now considering 1026/1030 (removed 4) transitions.
[2023-03-15 10:11:31] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
// Phase 1: matrix 1002 rows 360 cols
[2023-03-15 10:11:31] [INFO ] Computed 44 place invariants in 18 ms
[2023-03-15 10:11:31] [INFO ] Implicit Places using invariants in 358 ms returned []
[2023-03-15 10:11:31] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
[2023-03-15 10:11:31] [INFO ] Invariant cache hit.
[2023-03-15 10:11:31] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:11:43] [INFO ] Implicit Places using invariants and state equation in 11958 ms returned []
Implicit Place search using SMT with State Equation took 12319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 360/493 places, 1026/1155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13419 ms. Remains : 360/493 places, 1026/1155 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s359 1)) (OR (LT s258 1) (LT s359 1)) (OR (LT s306 1) (LT s309 1)) (OR (LT s0 1) (LT s20 1)) (OR (LT s20 1) (LT s309 1)) (OR (LT...], 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 874 reset in 507 ms.
Stack based approach found an accepted trace after 2793 steps with 35 reset with depth 336 and stack size 336 in 16 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-03 finished in 14005 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 5 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 22 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:11:44] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 492 cols
[2023-03-15 10:11:44] [INFO ] Computed 48 place invariants in 27 ms
[2023-03-15 10:11:45] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
[2023-03-15 10:11:45] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:11:45] [INFO ] Invariant cache hit.
[2023-03-15 10:11:45] [INFO ] Implicit Places using invariants in 464 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 467 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1154/1155 transitions.
Applied a total of 0 rules in 9 ms. Remains 488 /488 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1532 ms. Remains : 488/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s229 1) (GEQ s401 1)) (AND (GEQ s199 1) (GEQ s229 1)) (AND (GEQ s229 1) (GEQ s239 1)) (AND (GEQ s229 1) (GEQ s393 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 1 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-04 finished in 1638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(p2)||p1))||p0)))'
Support contains 22 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 493 transition count 1135
Reduce places removed 20 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 24 rules applied. Total rules applied 44 place count 473 transition count 1131
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 469 transition count 1131
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 48 place count 469 transition count 1075
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 160 place count 413 transition count 1075
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 258 place count 364 transition count 1026
Applied a total of 258 rules in 56 ms. Remains 364 /493 variables (removed 129) and now considering 1026/1155 (removed 129) transitions.
[2023-03-15 10:11:45] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
// Phase 1: matrix 1002 rows 364 cols
[2023-03-15 10:11:45] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-15 10:11:46] [INFO ] Dead Transitions using invariants and state equation in 587 ms found 0 transitions.
[2023-03-15 10:11:46] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
[2023-03-15 10:11:46] [INFO ] Invariant cache hit.
[2023-03-15 10:11:46] [INFO ] Implicit Places using invariants in 378 ms returned [18, 72, 149, 301]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 381 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/493 places, 1026/1155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 356 transition count 1022
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 356 transition count 1022
Applied a total of 8 rules in 30 ms. Remains 356 /360 variables (removed 4) and now considering 1022/1026 (removed 4) transitions.
[2023-03-15 10:11:46] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
// Phase 1: matrix 998 rows 356 cols
[2023-03-15 10:11:46] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-15 10:11:47] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-15 10:11:47] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2023-03-15 10:11:47] [INFO ] Invariant cache hit.
[2023-03-15 10:11:47] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:11:56] [INFO ] Implicit Places using invariants and state equation in 9352 ms returned []
Implicit Place search using SMT with State Equation took 9729 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 356/493 places, 1022/1155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10785 ms. Remains : 356/493 places, 1022/1155 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s164 1) (GEQ s290 1)) (AND (GEQ s141 1) (GEQ s164 1)) (AND (GEQ s164 1) (GEQ s170 1)) (AND (GEQ s164 1) (GEQ s284 1))), p1:(OR (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 111 steps with 3 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-06 finished in 10948 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 12 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 493 transition count 1127
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 465 transition count 1127
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 56 place count 465 transition count 1071
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 168 place count 409 transition count 1071
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 266 place count 360 transition count 1022
Applied a total of 266 rules in 44 ms. Remains 360 /493 variables (removed 133) and now considering 1022/1155 (removed 133) transitions.
[2023-03-15 10:11:56] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
// Phase 1: matrix 998 rows 360 cols
[2023-03-15 10:11:56] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-15 10:11:57] [INFO ] Dead Transitions using invariants and state equation in 594 ms found 0 transitions.
[2023-03-15 10:11:57] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2023-03-15 10:11:57] [INFO ] Invariant cache hit.
[2023-03-15 10:11:57] [INFO ] Implicit Places using invariants in 365 ms returned [18, 72, 149, 299]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 367 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 356/493 places, 1022/1155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 352 transition count 1018
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 352 transition count 1018
Applied a total of 8 rules in 24 ms. Remains 352 /356 variables (removed 4) and now considering 1018/1022 (removed 4) transitions.
[2023-03-15 10:11:57] [INFO ] Flow matrix only has 994 transitions (discarded 24 similar events)
// Phase 1: matrix 994 rows 352 cols
[2023-03-15 10:11:57] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-15 10:11:58] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-15 10:11:58] [INFO ] Flow matrix only has 994 transitions (discarded 24 similar events)
[2023-03-15 10:11:58] [INFO ] Invariant cache hit.
[2023-03-15 10:11:58] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:12:03] [INFO ] Implicit Places using invariants and state equation in 5852 ms returned []
Implicit Place search using SMT with State Equation took 6245 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 352/493 places, 1018/1155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7276 ms. Remains : 352/493 places, 1018/1155 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s140 1) (LT s241 1) (LT s343 1)) (OR (LT s109 1) (LT s241 1) (LT s255 1)) (OR (LT s109 1) (LT s140 1) (LT s241 1)) (OR (LT s2 1) (LT s215 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-07 finished in 7335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||((F(p2)&&p1) U p3))) U (F(p5)&&p4))))'
Support contains 9 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 20 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:12:04] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 492 cols
[2023-03-15 10:12:04] [INFO ] Computed 48 place invariants in 26 ms
[2023-03-15 10:12:05] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
[2023-03-15 10:12:05] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:12:05] [INFO ] Invariant cache hit.
[2023-03-15 10:12:05] [INFO ] Implicit Places using invariants in 445 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 448 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1154/1155 transitions.
Applied a total of 0 rules in 9 ms. Remains 488 /488 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1501 ms. Remains : 488/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p4) (NOT p5)), (OR (NOT p4) (NOT p5)), (AND (NOT p0) (NOT p3)), (NOT p5)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p4), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p4 (NOT p5)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p5), acceptance={} source=3 dest: 3}]], initial=0, aps=[p4:(AND (GEQ s30 1) (GEQ s424 1)), p0:(AND (GEQ s352 1) (GEQ s362 2)), p3:(AND (GEQ s128 1) (GEQ s234 1) (GEQ s338 1)), p5:(AND (GEQ s147 1) (GEQ s415 1))...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 267 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-08 finished in 1778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 16 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:12:05] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:12:05] [INFO ] Invariant cache hit.
[2023-03-15 10:12:06] [INFO ] Dead Transitions using invariants and state equation in 992 ms found 0 transitions.
[2023-03-15 10:12:06] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:12:06] [INFO ] Invariant cache hit.
[2023-03-15 10:12:07] [INFO ] Implicit Places using invariants in 441 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 444 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1154/1155 transitions.
Applied a total of 0 rules in 7 ms. Remains 488 /488 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1460 ms. Remains : 488/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s182 1), p0:(OR (LT s118 1) (LT s151 1) (LT s338 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 463 reset in 313 ms.
Product exploration explored 100000 steps with 465 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 210 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185855 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185855 steps, saw 63972 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:12:11] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 488 cols
[2023-03-15 10:12:11] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-15 10:12:11] [INFO ] [Real]Absence check using 22 positive place invariants in 5 ms returned sat
[2023-03-15 10:12:11] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 17 ms returned sat
[2023-03-15 10:12:12] [INFO ] After 1305ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:12:12] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-15 10:12:12] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 18 ms returned sat
[2023-03-15 10:12:16] [INFO ] After 4087ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:12:17] [INFO ] After 887ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:17] [INFO ] After 959ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-15 10:12:17] [INFO ] After 5185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 1154/1154 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 488 transition count 1127
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 461 transition count 1127
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 54 place count 461 transition count 1071
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 166 place count 405 transition count 1071
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 262 place count 357 transition count 1023
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 266 place count 353 transition count 1019
Iterating global reduction 2 with 4 rules applied. Total rules applied 270 place count 353 transition count 1019
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 278 place count 353 transition count 1011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 286 place count 345 transition count 1011
Applied a total of 286 rules in 84 ms. Remains 345 /488 variables (removed 143) and now considering 1011/1154 (removed 143) transitions.
[2023-03-15 10:12:18] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
// Phase 1: matrix 987 rows 345 cols
[2023-03-15 10:12:18] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 10:12:18] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 345/488 places, 1011/1154 transitions.
Incomplete random walk after 10000 steps, including 97 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 278270 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278270 steps, saw 160984 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:12:21] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:12:21] [INFO ] Invariant cache hit.
[2023-03-15 10:12:21] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2023-03-15 10:12:21] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 20 ms returned sat
[2023-03-15 10:12:22] [INFO ] After 1330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:12:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-15 10:12:22] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-15 10:12:25] [INFO ] After 2218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:25] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:12:27] [INFO ] After 2668ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:27] [INFO ] After 2715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 10:12:27] [INFO ] After 5033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 17 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 345/345 places, 1011/1011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
[2023-03-15 10:12:27] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:12:27] [INFO ] Invariant cache hit.
[2023-03-15 10:12:28] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-15 10:12:28] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:12:28] [INFO ] Invariant cache hit.
[2023-03-15 10:12:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:12:34] [INFO ] Implicit Places using invariants and state equation in 5958 ms returned []
Implicit Place search using SMT with State Equation took 6345 ms to find 0 implicit places.
[2023-03-15 10:12:34] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 10:12:34] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:12:34] [INFO ] Invariant cache hit.
[2023-03-15 10:12:34] [INFO ] Dead Transitions using invariants and state equation in 504 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6896 ms. Remains : 345/345 places, 1011/1011 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 345 transition count 987
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 345 transition count 963
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 341 transition count 1003
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 341 transition count 999
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 337 transition count 999
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 337 transition count 989
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 327 transition count 989
Applied a total of 84 rules in 77 ms. Remains 327 /345 variables (removed 18) and now considering 989/1011 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 989 rows 327 cols
[2023-03-15 10:12:34] [INFO ] Computed 44 place invariants in 13 ms
[2023-03-15 10:12:35] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:12:35] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-15 10:12:35] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:12:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-15 10:12:35] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 13 ms returned sat
[2023-03-15 10:12:38] [INFO ] After 2357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:38] [INFO ] After 2407ms 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-15 10:12:38] [INFO ] After 2521ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 488 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 : 488/488 places, 1154/1154 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 488 transition count 1127
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 461 transition count 1127
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 54 place count 461 transition count 1071
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 166 place count 405 transition count 1071
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 260 place count 358 transition count 1024
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 264 place count 354 transition count 1020
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 354 transition count 1020
Applied a total of 268 rules in 45 ms. Remains 354 /488 variables (removed 134) and now considering 1020/1154 (removed 134) transitions.
[2023-03-15 10:12:38] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
// Phase 1: matrix 996 rows 354 cols
[2023-03-15 10:12:38] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 10:12:39] [INFO ] Dead Transitions using invariants and state equation in 609 ms found 0 transitions.
[2023-03-15 10:12:39] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:12:39] [INFO ] Invariant cache hit.
[2023-03-15 10:12:39] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-15 10:12:39] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:12:39] [INFO ] Invariant cache hit.
[2023-03-15 10:12:39] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:12:49] [INFO ] Implicit Places using invariants and state equation in 9975 ms returned []
Implicit Place search using SMT with State Equation took 10329 ms to find 0 implicit places.
[2023-03-15 10:12:49] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 10:12:49] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:12:49] [INFO ] Invariant cache hit.
[2023-03-15 10:12:50] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 354/488 places, 1020/1154 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11549 ms. Remains : 354/488 places, 1020/1154 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 101 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 241463 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 241463 steps, saw 136719 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:12:53] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:12:53] [INFO ] Invariant cache hit.
[2023-03-15 10:12:53] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:12:53] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 15 ms returned sat
[2023-03-15 10:12:53] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:12:53] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:12:53] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 20 ms returned sat
[2023-03-15 10:12:56] [INFO ] After 3301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:56] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:12:57] [INFO ] After 827ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:12:57] [INFO ] After 874ms 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-15 10:12:57] [INFO ] After 4299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 1020/1020 transitions.
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 2 place count 353 transition count 1019
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 353 transition count 1011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 345 transition count 1011
Applied a total of 18 rules in 38 ms. Remains 345 /354 variables (removed 9) and now considering 1011/1020 (removed 9) transitions.
[2023-03-15 10:12:57] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
// Phase 1: matrix 987 rows 345 cols
[2023-03-15 10:12:57] [INFO ] Computed 44 place invariants in 24 ms
[2023-03-15 10:12:58] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 543 ms. Remains : 345/354 places, 1011/1020 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280261 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280261 steps, saw 162271 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:13:01] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:13:01] [INFO ] Invariant cache hit.
[2023-03-15 10:13:01] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-15 10:13:01] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-15 10:13:02] [INFO ] After 1296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:13:02] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-15 10:13:02] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-15 10:13:05] [INFO ] After 2225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:13:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:13:07] [INFO ] After 2638ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:13:07] [INFO ] After 2689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-15 10:13:07] [INFO ] After 5042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 345/345 places, 1011/1011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
[2023-03-15 10:13:07] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:13:07] [INFO ] Invariant cache hit.
[2023-03-15 10:13:08] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-15 10:13:08] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:13:08] [INFO ] Invariant cache hit.
[2023-03-15 10:13:08] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:13:14] [INFO ] Implicit Places using invariants and state equation in 5929 ms returned []
Implicit Place search using SMT with State Equation took 6318 ms to find 0 implicit places.
[2023-03-15 10:13:14] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 10:13:14] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:13:14] [INFO ] Invariant cache hit.
[2023-03-15 10:13:14] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6865 ms. Remains : 345/345 places, 1011/1011 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 345 transition count 987
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 345 transition count 963
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 341 transition count 1003
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 341 transition count 999
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 337 transition count 999
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 337 transition count 989
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 327 transition count 989
Applied a total of 84 rules in 65 ms. Remains 327 /345 variables (removed 18) and now considering 989/1011 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 989 rows 327 cols
[2023-03-15 10:13:14] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-15 10:13:14] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:13:14] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-15 10:13:15] [INFO ] After 795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:13:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-15 10:13:15] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 12 ms returned sat
[2023-03-15 10:13:17] [INFO ] After 2381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:13:18] [INFO ] After 2440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 10:13:18] [INFO ] After 2556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 984 reset in 367 ms.
Product exploration explored 100000 steps with 974 reset in 382 ms.
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 1020/1020 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 1019
Applied a total of 2 rules in 18 ms. Remains 353 /354 variables (removed 1) and now considering 1019/1020 (removed 1) transitions.
[2023-03-15 10:13:19] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
// Phase 1: matrix 995 rows 353 cols
[2023-03-15 10:13:19] [INFO ] Computed 44 place invariants in 15 ms
[2023-03-15 10:13:19] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
[2023-03-15 10:13:19] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
[2023-03-15 10:13:19] [INFO ] Invariant cache hit.
[2023-03-15 10:13:20] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-15 10:13:20] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
[2023-03-15 10:13:20] [INFO ] Invariant cache hit.
[2023-03-15 10:13:20] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:13:31] [INFO ] Implicit Places using invariants and state equation in 11243 ms returned []
Implicit Place search using SMT with State Equation took 11612 ms to find 0 implicit places.
[2023-03-15 10:13:31] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 10:13:31] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
[2023-03-15 10:13:31] [INFO ] Invariant cache hit.
[2023-03-15 10:13:31] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/354 places, 1019/1020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12764 ms. Remains : 353/354 places, 1019/1020 transitions.
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-09 finished in 86247 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 493 transition count 1131
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 469 transition count 1131
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 48 place count 469 transition count 1075
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 160 place count 413 transition count 1075
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 258 place count 364 transition count 1026
Applied a total of 258 rules in 37 ms. Remains 364 /493 variables (removed 129) and now considering 1026/1155 (removed 129) transitions.
[2023-03-15 10:13:32] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
// Phase 1: matrix 1002 rows 364 cols
[2023-03-15 10:13:32] [INFO ] Computed 48 place invariants in 15 ms
[2023-03-15 10:13:32] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-15 10:13:32] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
[2023-03-15 10:13:32] [INFO ] Invariant cache hit.
[2023-03-15 10:13:32] [INFO ] Implicit Places using invariants in 363 ms returned [18, 74, 152, 302]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 367 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/493 places, 1026/1155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 356 transition count 1022
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 356 transition count 1022
Applied a total of 8 rules in 22 ms. Remains 356 /360 variables (removed 4) and now considering 1022/1026 (removed 4) transitions.
[2023-03-15 10:13:32] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
// Phase 1: matrix 998 rows 356 cols
[2023-03-15 10:13:33] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 10:13:33] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-03-15 10:13:33] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2023-03-15 10:13:33] [INFO ] Invariant cache hit.
[2023-03-15 10:13:33] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:13:42] [INFO ] Implicit Places using invariants and state equation in 9494 ms returned []
Implicit Place search using SMT with State Equation took 9861 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 356/493 places, 1022/1155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10871 ms. Remains : 356/493 places, 1022/1155 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s187 1) (LT s261 1)), p0:(OR (LT s26 1) (LT s58 1) (LT s117 1) (LT s257 8))], 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 982 reset in 366 ms.
Product exploration explored 100000 steps with 890 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 175 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 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 170087 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170087 steps, saw 92529 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 10:13:47] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2023-03-15 10:13:47] [INFO ] Invariant cache hit.
[2023-03-15 10:13:47] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-15 10:13:47] [INFO ] [Real]Absence check using 22 positive and 22 generalized place invariants in 15 ms returned sat
[2023-03-15 10:13:47] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-15 10:13:47] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-15 10:13:47] [INFO ] [Nat]Absence check using 22 positive and 22 generalized place invariants in 16 ms returned sat
[2023-03-15 10:13:49] [INFO ] After 2130ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-15 10:13:49] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:13:50] [INFO ] After 1195ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-15 10:13:52] [INFO ] After 3229ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 645 ms.
[2023-03-15 10:13:53] [INFO ] After 6083ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 356/356 places, 1022/1022 transitions.
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 356 transition count 1011
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 22 place count 345 transition count 1011
Applied a total of 22 rules in 30 ms. Remains 345 /356 variables (removed 11) and now considering 1011/1022 (removed 11) transitions.
[2023-03-15 10:13:53] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
// Phase 1: matrix 987 rows 345 cols
[2023-03-15 10:13:53] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 10:13:53] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 539 ms. Remains : 345/356 places, 1011/1022 transitions.
Incomplete random walk after 10000 steps, including 96 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 268277 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268277 steps, saw 154750 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:13:56] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:13:56] [INFO ] Invariant cache hit.
[2023-03-15 10:13:57] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-15 10:13:57] [INFO ] [Real]Absence check using 20 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-15 10:13:57] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:13:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-15 10:13:57] [INFO ] [Nat]Absence check using 20 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-15 10:13:59] [INFO ] After 2229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:13:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:14:00] [INFO ] After 1024ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:14:04] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 0 ms to minimize.
[2023-03-15 10:14:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 179 ms
[2023-03-15 10:14:04] [INFO ] After 4850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 883 ms.
[2023-03-15 10:14:05] [INFO ] After 8040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 345/345 places, 1011/1011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
[2023-03-15 10:14:05] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:14:05] [INFO ] Invariant cache hit.
[2023-03-15 10:14:05] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-15 10:14:05] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:14:05] [INFO ] Invariant cache hit.
[2023-03-15 10:14:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:14:16] [INFO ] Implicit Places using invariants and state equation in 11094 ms returned []
Implicit Place search using SMT with State Equation took 11447 ms to find 0 implicit places.
[2023-03-15 10:14:16] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 10:14:16] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:14:16] [INFO ] Invariant cache hit.
[2023-03-15 10:14:17] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12020 ms. Remains : 345/345 places, 1011/1011 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 345 transition count 987
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 345 transition count 963
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 341 transition count 1003
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 341 transition count 999
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 337 transition count 999
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 337 transition count 995
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 72 place count 333 transition count 995
Applied a total of 72 rules in 60 ms. Remains 333 /345 variables (removed 12) and now considering 995/1011 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 995 rows 333 cols
[2023-03-15 10:14:17] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-15 10:14:17] [INFO ] [Real]Absence check using 24 positive place invariants in 5 ms returned sat
[2023-03-15 10:14:17] [INFO ] [Real]Absence check using 24 positive and 20 generalized place invariants in 12 ms returned sat
[2023-03-15 10:14:18] [INFO ] After 979ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:14:18] [INFO ] [Nat]Absence check using 24 positive place invariants in 4 ms returned sat
[2023-03-15 10:14:18] [INFO ] [Nat]Absence check using 24 positive and 20 generalized place invariants in 12 ms returned sat
[2023-03-15 10:14:20] [INFO ] After 2548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:14:22] [INFO ] After 4086ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 368 ms.
[2023-03-15 10:14:22] [INFO ] After 4534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 157 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-10 finished in 50912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 3 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 17 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:14:22] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 492 cols
[2023-03-15 10:14:22] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-15 10:14:23] [INFO ] Dead Transitions using invariants and state equation in 953 ms found 0 transitions.
[2023-03-15 10:14:23] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:14:23] [INFO ] Invariant cache hit.
[2023-03-15 10:14:24] [INFO ] Implicit Places using invariants in 427 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 430 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1154/1155 transitions.
Applied a total of 0 rules in 9 ms. Remains 488 /488 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1410 ms. Remains : 488/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s118 1) (GEQ s421 1)), p0:(GEQ s80 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 286 steps with 0 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-11 finished in 1542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U p1)&&X(X(F(p2)))))'
Support contains 5 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Applied a total of 0 rules in 6 ms. Remains 493 /493 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
[2023-03-15 10:14:24] [INFO ] Flow matrix only has 1131 transitions (discarded 24 similar events)
// Phase 1: matrix 1131 rows 493 cols
[2023-03-15 10:14:24] [INFO ] Computed 48 place invariants in 18 ms
[2023-03-15 10:14:25] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
[2023-03-15 10:14:25] [INFO ] Flow matrix only has 1131 transitions (discarded 24 similar events)
[2023-03-15 10:14:25] [INFO ] Invariant cache hit.
[2023-03-15 10:14:25] [INFO ] Implicit Places using invariants in 447 ms returned [22, 101, 209, 411]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 449 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 489/493 places, 1155/1155 transitions.
Applied a total of 0 rules in 7 ms. Remains 489 /489 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1486 ms. Remains : 489/493 places, 1155/1155 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p2) (NOT p1)), true, p0, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s28 1), p0:(AND (GEQ s96 1) (GEQ s380 1)), p2:(AND (GEQ s54 1) (GEQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1112 steps with 2 reset in 5 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-12 finished in 1795 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 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 12 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:14:26] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 492 cols
[2023-03-15 10:14:26] [INFO ] Computed 48 place invariants in 28 ms
[2023-03-15 10:14:27] [INFO ] Dead Transitions using invariants and state equation in 1026 ms found 0 transitions.
[2023-03-15 10:14:27] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:14:27] [INFO ] Invariant cache hit.
[2023-03-15 10:14:27] [INFO ] Implicit Places using invariants in 449 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 452 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1154/1155 transitions.
Applied a total of 0 rules in 8 ms. Remains 488 /488 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1499 ms. Remains : 488/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-13 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:(LT s105 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 439 steps with 3 reset in 3 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-13 finished in 1596 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(G(p1))))'
Support contains 7 out of 493 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 493 transition count 1131
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 469 transition count 1131
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 48 place count 469 transition count 1075
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 160 place count 413 transition count 1075
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 258 place count 364 transition count 1026
Applied a total of 258 rules in 44 ms. Remains 364 /493 variables (removed 129) and now considering 1026/1155 (removed 129) transitions.
[2023-03-15 10:14:27] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
// Phase 1: matrix 1002 rows 364 cols
[2023-03-15 10:14:27] [INFO ] Computed 48 place invariants in 24 ms
[2023-03-15 10:14:28] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
[2023-03-15 10:14:28] [INFO ] Flow matrix only has 1002 transitions (discarded 24 similar events)
[2023-03-15 10:14:28] [INFO ] Invariant cache hit.
[2023-03-15 10:14:28] [INFO ] Implicit Places using invariants in 376 ms returned [18, 74, 152, 302]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 378 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/493 places, 1026/1155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 356 transition count 1022
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 356 transition count 1022
Applied a total of 8 rules in 22 ms. Remains 356 /360 variables (removed 4) and now considering 1022/1026 (removed 4) transitions.
[2023-03-15 10:14:28] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
// Phase 1: matrix 998 rows 356 cols
[2023-03-15 10:14:28] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 10:14:29] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-15 10:14:29] [INFO ] Flow matrix only has 998 transitions (discarded 24 similar events)
[2023-03-15 10:14:29] [INFO ] Invariant cache hit.
[2023-03-15 10:14:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:14:37] [INFO ] Implicit Places using invariants and state equation in 8118 ms returned []
Implicit Place search using SMT with State Equation took 8503 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 356/493 places, 1022/1155 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9497 ms. Remains : 356/493 places, 1022/1155 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s30 1) (LT s52 1)), p1:(AND (GEQ s26 1) (GEQ s58 1) (GEQ s119 1) (GEQ s257 7) (GEQ s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-14 finished in 9612 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(G(p0))||((p1 U p2)&&G(p3))))))'
Support contains 9 out of 493 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 492 transition count 1154
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 492 transition count 1154
Applied a total of 2 rules in 19 ms. Remains 492 /493 variables (removed 1) and now considering 1154/1155 (removed 1) transitions.
[2023-03-15 10:14:37] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
// Phase 1: matrix 1130 rows 492 cols
[2023-03-15 10:14:37] [INFO ] Computed 48 place invariants in 23 ms
[2023-03-15 10:14:38] [INFO ] Dead Transitions using invariants and state equation in 1019 ms found 0 transitions.
[2023-03-15 10:14:38] [INFO ] Flow matrix only has 1130 transitions (discarded 24 similar events)
[2023-03-15 10:14:38] [INFO ] Invariant cache hit.
[2023-03-15 10:14:38] [INFO ] Implicit Places using invariants in 408 ms returned [22, 101, 208, 410]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 410 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 488/493 places, 1154/1155 transitions.
Applied a total of 0 rules in 8 ms. Remains 488 /488 variables (removed 0) and now considering 1154/1154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1457 ms. Remains : 488/493 places, 1154/1155 transitions.
Stuttering acceptance computed with spot in 315 ms :[true, (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0)]
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p3 p0), acceptance={} source=2 dest: 2}, { cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 8}], [{ cond=(OR (AND (NOT p2) (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p3 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 p3 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(OR (AND (NOT p2) (NOT p1) p0) (AND (NOT p3) p0)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={} source=4 dest: 0}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=5 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=7, aps=[p2:(AND (GEQ s229 1) (GEQ s393 1)), p1:(GEQ s302 1), p3:(AND (GEQ s9 1) (GEQ s37 1) (GEQ s358 9)), p0:(AND (GEQ s198 1) (GEQ s254 1) (GEQ s303 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-15 finished in 1792 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)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Found a Shortening insensitive property : PolyORBLF-PT-S06J06T04-LTLFireability-09
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 493 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 493/493 places, 1155/1155 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 493 transition count 1128
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 466 transition count 1128
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 54 place count 466 transition count 1072
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 166 place count 410 transition count 1072
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 262 place count 362 transition count 1024
Applied a total of 262 rules in 43 ms. Remains 362 /493 variables (removed 131) and now considering 1024/1155 (removed 131) transitions.
[2023-03-15 10:14:39] [INFO ] Flow matrix only has 1000 transitions (discarded 24 similar events)
// Phase 1: matrix 1000 rows 362 cols
[2023-03-15 10:14:39] [INFO ] Computed 48 place invariants in 19 ms
[2023-03-15 10:14:40] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
[2023-03-15 10:14:40] [INFO ] Flow matrix only has 1000 transitions (discarded 24 similar events)
[2023-03-15 10:14:40] [INFO ] Invariant cache hit.
[2023-03-15 10:14:40] [INFO ] Implicit Places using invariants in 359 ms returned [18, 72, 150, 300]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 361 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 358/493 places, 1024/1155 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 354 transition count 1020
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 354 transition count 1020
Applied a total of 8 rules in 17 ms. Remains 354 /358 variables (removed 4) and now considering 1020/1024 (removed 4) transitions.
[2023-03-15 10:14:40] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
// Phase 1: matrix 996 rows 354 cols
[2023-03-15 10:14:40] [INFO ] Computed 44 place invariants in 22 ms
[2023-03-15 10:14:40] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-15 10:14:40] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:14:40] [INFO ] Invariant cache hit.
[2023-03-15 10:14:41] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:14:47] [INFO ] Implicit Places using invariants and state equation in 6040 ms returned []
Implicit Place search using SMT with State Equation took 6444 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 354/493 places, 1020/1155 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7410 ms. Remains : 354/493 places, 1020/1155 transitions.
Running random walk in product with property : PolyORBLF-PT-S06J06T04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s128 1), p0:(OR (LT s84 1) (LT s105 1) (LT s240 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 929 reset in 357 ms.
Product exploration explored 100000 steps with 955 reset in 372 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 98 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242102 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242102 steps, saw 137145 distinct states, run finished after 3001 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:14:51] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:14:51] [INFO ] Invariant cache hit.
[2023-03-15 10:14:51] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-15 10:14:51] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 15 ms returned sat
[2023-03-15 10:14:51] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:14:51] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-15 10:14:51] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 19 ms returned sat
[2023-03-15 10:14:55] [INFO ] After 3780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:14:55] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:14:55] [INFO ] After 713ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:14:55] [INFO ] After 762ms 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-15 10:14:55] [INFO ] After 4655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 1020/1020 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 1019
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 353 transition count 1011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 345 transition count 1011
Applied a total of 18 rules in 36 ms. Remains 345 /354 variables (removed 9) and now considering 1011/1020 (removed 9) transitions.
[2023-03-15 10:14:55] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
// Phase 1: matrix 987 rows 345 cols
[2023-03-15 10:14:55] [INFO ] Computed 44 place invariants in 21 ms
[2023-03-15 10:14:56] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 535 ms. Remains : 345/354 places, 1011/1020 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280924 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280924 steps, saw 162653 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:14:59] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:14:59] [INFO ] Invariant cache hit.
[2023-03-15 10:14:59] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-15 10:14:59] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-15 10:15:01] [INFO ] After 1569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:15:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-15 10:15:01] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-15 10:15:03] [INFO ] After 2201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:15:03] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:15:04] [INFO ] After 1401ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:15:04] [INFO ] After 1447ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-15 10:15:04] [INFO ] After 3751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 345/345 places, 1011/1011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 13 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
[2023-03-15 10:15:04] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:04] [INFO ] Invariant cache hit.
[2023-03-15 10:15:05] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-15 10:15:05] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:05] [INFO ] Invariant cache hit.
[2023-03-15 10:15:05] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:15:12] [INFO ] Implicit Places using invariants and state equation in 7284 ms returned []
Implicit Place search using SMT with State Equation took 7665 ms to find 0 implicit places.
[2023-03-15 10:15:12] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 10:15:12] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:12] [INFO ] Invariant cache hit.
[2023-03-15 10:15:12] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8187 ms. Remains : 345/345 places, 1011/1011 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 345 transition count 987
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 345 transition count 963
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 341 transition count 1003
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 341 transition count 999
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 337 transition count 999
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 337 transition count 989
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 327 transition count 989
Applied a total of 84 rules in 60 ms. Remains 327 /345 variables (removed 18) and now considering 989/1011 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 989 rows 327 cols
[2023-03-15 10:15:13] [INFO ] Computed 44 place invariants in 19 ms
[2023-03-15 10:15:13] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:15:13] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 13 ms returned sat
[2023-03-15 10:15:13] [INFO ] After 433ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 10:15:13] [INFO ] After 486ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 10:15:13] [INFO ] After 594ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), true, (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 354 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 : 354/354 places, 1020/1020 transitions.
Applied a total of 0 rules in 18 ms. Remains 354 /354 variables (removed 0) and now considering 1020/1020 (removed 0) transitions.
[2023-03-15 10:15:13] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
// Phase 1: matrix 996 rows 354 cols
[2023-03-15 10:15:13] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 10:15:14] [INFO ] Dead Transitions using invariants and state equation in 590 ms found 0 transitions.
[2023-03-15 10:15:14] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:15:14] [INFO ] Invariant cache hit.
[2023-03-15 10:15:14] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-15 10:15:14] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:15:14] [INFO ] Invariant cache hit.
[2023-03-15 10:15:15] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:15:21] [INFO ] Implicit Places using invariants and state equation in 6456 ms returned []
Implicit Place search using SMT with State Equation took 6826 ms to find 0 implicit places.
[2023-03-15 10:15:21] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-15 10:15:21] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:15:21] [INFO ] Invariant cache hit.
[2023-03-15 10:15:21] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8024 ms. Remains : 354/354 places, 1020/1020 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 88 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 232011 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232011 steps, saw 130737 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:15:25] [INFO ] Flow matrix only has 996 transitions (discarded 24 similar events)
[2023-03-15 10:15:25] [INFO ] Invariant cache hit.
[2023-03-15 10:15:25] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-15 10:15:25] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 16 ms returned sat
[2023-03-15 10:15:25] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:15:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:15:25] [INFO ] [Nat]Absence check using 21 positive and 23 generalized place invariants in 21 ms returned sat
[2023-03-15 10:15:29] [INFO ] After 3847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:15:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:15:29] [INFO ] After 724ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:15:30] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-15 10:15:30] [INFO ] After 4760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 1020/1020 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 1019
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 353 transition count 1011
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 18 place count 345 transition count 1011
Applied a total of 18 rules in 35 ms. Remains 345 /354 variables (removed 9) and now considering 1011/1020 (removed 9) transitions.
[2023-03-15 10:15:30] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
// Phase 1: matrix 987 rows 345 cols
[2023-03-15 10:15:30] [INFO ] Computed 44 place invariants in 23 ms
[2023-03-15 10:15:30] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 580 ms. Remains : 345/354 places, 1011/1020 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 274750 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274750 steps, saw 158677 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:15:33] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:33] [INFO ] Invariant cache hit.
[2023-03-15 10:15:33] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2023-03-15 10:15:33] [INFO ] [Real]Absence check using 18 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-15 10:15:35] [INFO ] After 1604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:15:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2023-03-15 10:15:35] [INFO ] [Nat]Absence check using 18 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-15 10:15:37] [INFO ] After 2293ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:15:37] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:15:39] [INFO ] After 1420ms SMT Verify possible using 112 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:15:39] [INFO ] After 1471ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-15 10:15:39] [INFO ] After 3910ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 345 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 16 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 345/345 places, 1011/1011 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 345/345 places, 1011/1011 transitions.
Applied a total of 0 rules in 14 ms. Remains 345 /345 variables (removed 0) and now considering 1011/1011 (removed 0) transitions.
[2023-03-15 10:15:39] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:39] [INFO ] Invariant cache hit.
[2023-03-15 10:15:39] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-15 10:15:39] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:39] [INFO ] Invariant cache hit.
[2023-03-15 10:15:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:15:48] [INFO ] Implicit Places using invariants and state equation in 8344 ms returned []
Implicit Place search using SMT with State Equation took 8741 ms to find 0 implicit places.
[2023-03-15 10:15:48] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-15 10:15:48] [INFO ] Flow matrix only has 987 transitions (discarded 24 similar events)
[2023-03-15 10:15:48] [INFO ] Invariant cache hit.
[2023-03-15 10:15:48] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9302 ms. Remains : 345/345 places, 1011/1011 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 345 transition count 987
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 48 place count 345 transition count 963
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 341 transition count 1003
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 341 transition count 999
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 64 place count 337 transition count 999
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 74 place count 337 transition count 989
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 84 place count 327 transition count 989
Applied a total of 84 rules in 74 ms. Remains 327 /345 variables (removed 18) and now considering 989/1011 (removed 22) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 989 rows 327 cols
[2023-03-15 10:15:48] [INFO ] Computed 44 place invariants in 20 ms
[2023-03-15 10:15:48] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-15 10:15:48] [INFO ] [Real]Absence check using 21 positive and 23 generalized place invariants in 13 ms returned sat
[2023-03-15 10:15:49] [INFO ] After 412ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 10:15:49] [INFO ] After 454ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-15 10:15:49] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 945 reset in 360 ms.
Product exploration explored 100000 steps with 918 reset in 372 ms.
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 1020/1020 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 353 transition count 1019
Applied a total of 2 rules in 18 ms. Remains 353 /354 variables (removed 1) and now considering 1019/1020 (removed 1) transitions.
[2023-03-15 10:15:50] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
// Phase 1: matrix 995 rows 353 cols
[2023-03-15 10:15:50] [INFO ] Computed 44 place invariants in 25 ms
[2023-03-15 10:15:50] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
[2023-03-15 10:15:50] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
[2023-03-15 10:15:50] [INFO ] Invariant cache hit.
[2023-03-15 10:15:51] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-15 10:15:51] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
[2023-03-15 10:15:51] [INFO ] Invariant cache hit.
[2023-03-15 10:15:51] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-15 10:16:00] [INFO ] Implicit Places using invariants and state equation in 9533 ms returned []
Implicit Place search using SMT with State Equation took 9905 ms to find 0 implicit places.
[2023-03-15 10:16:00] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 10:16:00] [INFO ] Flow matrix only has 995 transitions (discarded 24 similar events)
[2023-03-15 10:16:00] [INFO ] Invariant cache hit.
[2023-03-15 10:16:01] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 353/354 places, 1019/1020 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11082 ms. Remains : 353/354 places, 1019/1020 transitions.
Treatment of property PolyORBLF-PT-S06J06T04-LTLFireability-09 finished in 82016 ms.
[2023-03-15 10:16:01] [INFO ] Flatten gal took : 63 ms
[2023-03-15 10:16:01] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 7 ms.
[2023-03-15 10:16:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 493 places, 1155 transitions and 5900 arcs took 6 ms.
Total runtime 348962 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBLF-PT-S06J06T04
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
FORMULA PolyORBLF-PT-S06J06T04-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678875656484
--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 3 (type EXCL) for 0 PolyORBLF-PT-S06J06T04-LTLFireability-00
lola: time limit : 1197 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
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 4/1197 1/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 55457 m, 11091 m/sec, 102465 t fired, .
Time elapsed: 12 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 9/1197 2/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 115099 m, 11928 m/sec, 194080 t fired, .
Time elapsed: 17 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 14/1197 2/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 175585 m, 12097 m/sec, 284135 t fired, .
Time elapsed: 22 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 19/1197 3/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 236759 m, 12234 m/sec, 370182 t fired, .
Time elapsed: 27 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 24/1197 3/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 298683 m, 12384 m/sec, 456995 t fired, .
Time elapsed: 32 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 29/1197 4/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 361109 m, 12485 m/sec, 542344 t fired, .
Time elapsed: 37 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 34/1197 5/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 423557 m, 12489 m/sec, 628512 t fired, .
Time elapsed: 42 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 39/1197 5/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 486347 m, 12558 m/sec, 714961 t fired, .
Time elapsed: 47 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 44/1197 6/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 549047 m, 12540 m/sec, 800900 t fired, .
Time elapsed: 52 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 49/1197 6/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 611887 m, 12568 m/sec, 887209 t fired, .
Time elapsed: 57 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 54/1197 7/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 675137 m, 12650 m/sec, 974750 t fired, .
Time elapsed: 62 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 59/1197 8/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 738427 m, 12658 m/sec, 1062749 t fired, .
Time elapsed: 67 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 64/1197 8/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 801902 m, 12695 m/sec, 1150585 t fired, .
Time elapsed: 72 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 69/1197 9/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 865328 m, 12685 m/sec, 1238859 t fired, .
Time elapsed: 77 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 74/1197 10/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 929075 m, 12749 m/sec, 1328113 t fired, .
Time elapsed: 82 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 79/1197 10/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 993082 m, 12801 m/sec, 1417217 t fired, .
Time elapsed: 87 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 84/1197 11/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1056588 m, 12701 m/sec, 1506688 t fired, .
Time elapsed: 92 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 89/1197 11/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1120512 m, 12784 m/sec, 1597682 t fired, .
Time elapsed: 97 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 94/1197 12/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1184169 m, 12731 m/sec, 1687428 t fired, .
Time elapsed: 102 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 99/1197 13/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1247949 m, 12756 m/sec, 1777476 t fired, .
Time elapsed: 107 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 104/1197 13/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1312092 m, 12828 m/sec, 1868203 t fired, .
Time elapsed: 112 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 109/1197 14/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1376130 m, 12807 m/sec, 1960294 t fired, .
Time elapsed: 117 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 114/1197 15/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1440476 m, 12869 m/sec, 2052641 t fired, .
Time elapsed: 122 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 119/1197 15/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1504368 m, 12778 m/sec, 2146278 t fired, .
Time elapsed: 127 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 124/1197 16/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1568225 m, 12771 m/sec, 2238117 t fired, .
Time elapsed: 132 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 129/1197 16/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1632331 m, 12821 m/sec, 2329593 t fired, .
Time elapsed: 137 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 134/1197 17/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1696370 m, 12807 m/sec, 2423979 t fired, .
Time elapsed: 142 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 139/1197 18/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1760509 m, 12827 m/sec, 2517488 t fired, .
Time elapsed: 147 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 144/1197 18/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1824813 m, 12860 m/sec, 2611827 t fired, .
Time elapsed: 152 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 149/1197 19/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1889239 m, 12885 m/sec, 2707788 t fired, .
Time elapsed: 157 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 154/1197 19/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 1953996 m, 12951 m/sec, 2803353 t fired, .
Time elapsed: 162 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 159/1197 20/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2018379 m, 12876 m/sec, 2900810 t fired, .
Time elapsed: 167 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 164/1197 21/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2082626 m, 12849 m/sec, 2997179 t fired, .
Time elapsed: 172 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 169/1197 21/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2147471 m, 12969 m/sec, 3095052 t fired, .
Time elapsed: 177 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 174/1197 22/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2212176 m, 12941 m/sec, 3191035 t fired, .
Time elapsed: 182 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 179/1197 23/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2276589 m, 12882 m/sec, 3286064 t fired, .
Time elapsed: 187 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 184/1197 23/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2341221 m, 12926 m/sec, 3383525 t fired, .
Time elapsed: 192 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 189/1197 24/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2405847 m, 12925 m/sec, 3482314 t fired, .
Time elapsed: 197 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 194/1197 24/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2470645 m, 12959 m/sec, 3580496 t fired, .
Time elapsed: 202 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 199/1197 25/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2535127 m, 12896 m/sec, 3679231 t fired, .
Time elapsed: 207 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 204/1197 26/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2600253 m, 13025 m/sec, 3777897 t fired, .
Time elapsed: 212 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 209/1197 26/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2665053 m, 12960 m/sec, 3877748 t fired, .
Time elapsed: 217 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 214/1197 27/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2729774 m, 12944 m/sec, 3976837 t fired, .
Time elapsed: 222 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 219/1197 27/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2794422 m, 12929 m/sec, 4078636 t fired, .
Time elapsed: 227 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 224/1197 28/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2858922 m, 12900 m/sec, 4180264 t fired, .
Time elapsed: 232 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 229/1197 29/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2923357 m, 12887 m/sec, 4282460 t fired, .
Time elapsed: 237 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 234/1197 29/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 2988287 m, 12986 m/sec, 4381089 t fired, .
Time elapsed: 242 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 239/1197 30/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 3053105 m, 12963 m/sec, 4483606 t fired, .
Time elapsed: 247 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 244/1197 31/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 3117947 m, 12968 m/sec, 4583228 t fired, .
Time elapsed: 252 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 249/1197 31/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 3182791 m, 12968 m/sec, 4685939 t fired, .
Time elapsed: 257 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 254/1197 32/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 3247694 m, 12980 m/sec, 4788481 t fired, .
Time elapsed: 262 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 259/1197 32/32 PolyORBLF-PT-S06J06T04-LTLFireability-00 3312492 m, 12959 m/sec, 4888299 t fired, .
Time elapsed: 267 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 3 (type EXCL) for PolyORBLF-PT-S06J06T04-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 273 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 8 (type EXCL) for 7 PolyORBLF-PT-S06J06T04-LTLFireability-09
lola: time limit : 1663 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
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 4/1663 8/32 PolyORBLF-PT-S06J06T04-LTLFireability-09 653119 m, 130623 m/sec, 1391903 t fired, .
Time elapsed: 277 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1663 17/32 PolyORBLF-PT-S06J06T04-LTLFireability-09 1438432 m, 157062 m/sec, 2629788 t fired, .
Time elapsed: 283 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1663 26/32 PolyORBLF-PT-S06J06T04-LTLFireability-09 2235544 m, 159422 m/sec, 3824569 t fired, .
Time elapsed: 288 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 8 (type EXCL) for PolyORBLF-PT-S06J06T04-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 293 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 5 (type EXCL) for 0 PolyORBLF-PT-S06J06T04-LTLFireability-00
lola: time limit : 3307 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for PolyORBLF-PT-S06J06T04-LTLFireability-00
lola: result : false
lola: markings : 13433
lola: fired transitions : 28432
lola: time used : 1.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBLF-PT-S06J06T04-LTLFireability-00: CONJ false LTL model checker
PolyORBLF-PT-S06J06T04-LTLFireability-09: LTL unknown AGGR
Time elapsed: 294 secs. Pages in use: 32
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J06T04"
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 PolyORBLF-PT-S06J06T04, 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 r295-tall-167873948100612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T04.tgz
mv PolyORBLF-PT-S06J06T04 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 '
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 ;